Sciweavers

13214 search results - page 5 / 2643
» Pseudorandomness for network algorithms
Sort
View
FSE
2003
Springer
123views Cryptology» more  FSE 2003»
15 years 4 months ago
The Security of "One-Block-to-Many" Modes of Operation
In this paper, we investigate the security, in the Luby-Rackoff security paradigm, of blockcipher modes of operation allowing to expand a one-block input into a longer t-block ou...
Henri Gilbert
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 3 months ago
Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...
Iftach Haitner, Omer Reingold and Salil Vadhan
89
Voted
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
14 years 11 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
APPROX
2009
Springer
87views Algorithms» more  APPROX 2009»
15 years 6 months ago
Pseudorandom Bit Generators That Fool Modular Sums
Shachar Lovett, Omer Reingold, Luca Trevisan, Sali...