290 search results - page 8 / 58 » Pseudorandom Bits for Polynomials |
106
Voted
ASIACRYPT
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. Beth and Dai studied in their Eurocrypt paper [1] the relationship between linear complexity (that is, the length of the shortest Linear Feedback Shift Register that gene...
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
122
click to vote
ESORICS
2004
Springer
15 years 5 months ago
2004
Springer
This work presents a practical public-key encryption scheme that offers security under adaptive chosen-ciphertext attack (CCA) and has pseudo-random ciphertexts, i.e. ciphertexts ...
92
Voted
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
Sequence compression is one of the most promising tools for strengthening pseudo-random generators used in stream ciphers. Indeed, adding compression components can thwart algebrai...
CORR
2010
Springer
15 years 10 days ago
2010
Springer
It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity ...