290 search results - page 5 / 58 » Pseudorandom Bits for Polynomials |
ASIACRYPT
2001
Springer
14 years 2 months ago
2001
Springer
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...
EUROCRYPT
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
JOC
1998
13 years 9 months ago
1998
We describe a software-e cient encryption algorithm named SEAL 3.0. Computational cost on a modern 32-bit processor is about 4 clock cycles per byte of text. The cipher is a pseudo...
ASIACRYPT
2006
Springer
14 years 1 months ago
2006
Springer
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...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
This paper investigates the impact of the changes of the characteristic polynomials and initial loadings, on behaviour of aliasing errors of parallel signature analyzer (Multi-Inp...