How to generate cryptographically strong sequences of pseudo random bits
- 1 November 1982
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
- p. 112-117
- https://doi.org/10.1109/sfcs.1982.72
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the generation of cryptographically strong pseudorandom sequencesACM Transactions on Computer Systems, 1983
- Inferring a sequence generated by a linear congruencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Probabilistic encryption & how to play mental poker keeping secret all partial informationPublished by Association for Computing Machinery (ACM) ,1982
- A subexponential algorithm for the discrete logarithm problem with applications to cryptographyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978