Sciweavers

397 search results - page 3 / 80
» Pseudorandom Functions and Lattices
Sort
View
ASIACRYPT
2001
Springer
13 years 9 months ago
Practical Construction and Analysis of Pseudo-Randomness Primitives
Abstract. We give a careful, fixed-size parameter analysis of a standard [1,4] way to form a pseudorandom generator by iterating a one-way function and then pseudo-random function...
Johan Håstad, Mats Näslund
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
13 years 9 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
IPL
2000
98views more  IPL 2000»
13 years 5 months ago
Linear complexity of the Naor-Reingold pseudo-random function
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of t...
Igor Shparlinski
EJC
2010
13 years 5 months ago
Discrete piecewise linear functions
The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions t...
Sergei Ovchinnikov
ASIACRYPT
2006
Springer
13 years 9 months ago
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang