On the Linear Complexity of the Power Generator

Designs, Codes, and Cryptography

Volumn 23, Issue 1, 2001, Pages 5-10

  Shparlinski, Igor ^a  

^a MACQUARIE UNIVERSITY   (Australia)

Author keywords

Blum Blum Shub generator; Cryptography; Linear complexity; Power generator; RSA generator

Indexed keywords

EID: 0035341960     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011264815860     Document Type: Article

References (19)

1. E. Bach, Toward a theory of Pollard's rho method, Inform. and Comp., Vol. 90 (1991) pp. 139-155.
2. E. Bach and J. Shallit, Algorithmic Number Theory, MIT Press (1996).
3. L. Blum, M. Blum, and M. Shub, A simple unpredictable pseudo-random number generator, SIAM J. Comp., Vol. 15 (1986) pp. 364-383.
4. α mod N, Designs, Codes and Cryptography, Vol. 13 (1998) pp. 229-245.
5. 2 mod N pseudorandom number generator, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 1155-1159.
6. T. W. Cusick, C. Ding, and A. Renvall, Stream Ciphers and Number Theory, Elsevier, Amsterdam (1998).
7. R. Fischlin and C. P. Schnorr, Stronger security proofs for RSA and Rabin bits. In Proc. Intern. Conf. on the Theory and Application of Cryptographic Techniques (Eurocrypt'97), Konstanz, Lect. Notes in Comp. Sci., Springer-Verlag, Berlin, Vol. 1233 (1997) pp. 267-279.
8. J. B. Friedlander, D. Lieman, and I. E. Shparlinski, On the distribution of the RSA generator. In Proc. Intern. Conf. on Sequences and their Applications (SETA'98), Singapore, Springer-Verlag, London (1999) pp. 205-212.
9. J. B. Friedlander, C. Pomerance, and I. E. Shparlinski, Period of the power generator and small values of Carmichael's function, Math. Comp. V. (to appear).
10. J. B. Friedlander and I. E. Shparlinski, On the distribution of the power generator, Math. Comp. V. (1999) (to appear).
11. J. Håstad and M. Näslund, The security of individual RSA bits. In Proc 39th IEEE Symp. on Foundations of Comp. Sci. (1998) pp. 510-519.
12. A. Joux and J. Stern, Lattice reduction: A toolbox for the cryptanalyst, J. Cryptology, Vol. 11 (1998) pp. 161-185.
13. J. C. Lagarias, Pseudorandom number generators in cryptography and number theory. In Proc. Symp. in Appl. Math., Amer. Math. Soc., Providence, RI, Vol. 42 (1990) pp. 115-143.
14. R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge (1997).
15. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone, Handbook of Cryptography, CRC Press, Boca Raton, FL (1996).
16. H. Niederreiter, Some computable complexity measures for binary sequences. In Proc. Intern. Conf. on Sequences and their Applications (SETA'98), Singapore, Springer-Verlag, London (1999) pp. 67-78.
17. H. Niederreiter and M. Vielhaber, Linear complexity profiles: Hausdorf dimension for almost perfect profiles and measures for general profiles, J. Compl., Vol. 13 (1996) pp. 353-383.
18. R. A. Rueppel, Stream ciphers, Contemporary Cryptology: The Science of Information Integrity, IEEE Press, NY (1992) pp. 65-134.
19. D. R. Stinson, Cryptography: Theory and Practice, CRC Press, Boca Raton, FL (1995).