How to generate cryptographically strong sequences of pseudo random bits

This publication has 6 references indexed in Scilit:

• On the generation of cryptographically strong pseudorandom sequences
  ACM Transactions on Computer Systems, 1983
• Inferring a sequence generated by a linear congruence
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
• Probabilistic encryption & how to play mental poker keeping secret all partial information
  Published by Association for Computing Machinery (ACM) ,1982
• A subexponential algorithm for the discrete logarithm problem with applications to cryptography
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• A method for obtaining digital signatures and public-key cryptosystems
  Communications of the ACM, 1978
• An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)
  IEEE Transactions on Information Theory, 1978