An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 245-255
- https://doi.org/10.1007/3-540-68339-9_22
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A method for finding codewords of small weightPublished by Springer Nature ,2005
- The discrete logarithm modulo a composite hides 0(n) BitsJournal of Computer and System Sciences, 1993
- The Discrete Logarithm Hides $O(\log n)$ BitsSIAM Journal on Computing, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- A Simple Unpredictable Pseudo-Random Number GeneratorSIAM Journal on Computing, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984