How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- 1 November 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (4) , 850-864
- https://doi.org/10.1137/0213053
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Inferring a sequence generated by a linear congruencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Why and how to establish a private code on a public networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- How to generate cryptographically strong sequences of pseudo random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Sparse complete sets for NP: Solution of a conjecture of Berman and HartmanisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- A Note on Sparse Complete SetsSIAM Journal on Computing, 1979
- Relationship between density and deterministic complexity of MP-complete languagesPublished by Springer Nature ,1978
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970