8259 search results - page 218 / 1652 » On Generalized Feistel Networks |
85
Voted
DSOM
2007
Springer
15 years 6 months ago
2007
Springer
Link dimensioning is generally considered as an effective and (operationally) simple mechanism to meet (given) performance requirements. In practice, the required link capacity C...
STOC
1994
ACM
15 years 4 months ago
1994
ACM
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
108
Voted
CCS
2010
ACM
15 years 1 months ago
2010
ACM
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
94
Voted
CORR
2007
Springer
15 years 19 days ago
2007
Springer
—This paper investigates the many-to-one throughput capacity (and by symmetry, one-to-many throughput capacity) of IEEE 802.11 multi-hop networks. It has generally been assumed i...
APIN
2005
15 years 17 days ago
2005
In this paper, we discuss the degeneration of relevance of uncertain temporal information and propose an analytical upper bound for the relevance time of information in a restrict...