290 search results - page 6 / 58 » Pseudorandom Bits for Polynomials |
CRYPTO
1998
Springer
14 years 1 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
ASIACRYPT
2007
Springer
14 years 3 months ago
2007
Springer
Unbalanced Feistel schemes with expanding functions are used to construct pseudo-random permutations from kn bits to kn bits by using random functions from n bits to (k − 1)n bit...
TCOM
2008
13 years 9 months ago
2008
All binary polynomials of degree up to 10 which are suitable to be used as generator polynomials of CRC codes are classified and all the necessary data for the evaluation of the e...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
Related-key attacks are attacks against constructions which use a secret key (such as a blockcipher) in which an attacker attempts to exploit known or chosen relationships among ke...
MFCS
2001
Springer
14 years 2 months ago
2001
Springer
In this paper we consider the question of whether NC0 circuits can generate pseudorandom distributions. While we leave the general question unanswered, we show • Generators compu...