Properties of the x2 mod N Pseudorandom Number Generator

IEEE Transactions on Information Theory

Volumn 41, Issue 4, 1995, Pages 1155-1159

  Cusick, Thomas W ^a  

^a UNIVERSITY AT BUFFALO   (United States)

Author keywords

Blum Blum Shub generator; cryptology; Kronecker symbol; Pseudorandom numbers

Indexed keywords

BINARY SEQUENCES; CRYPTOGRAPHY; RANDOM NUMBER GENERATION; THEOREM PROVING;

BLUM-BLUM-SHUB GENERATOR; KRONECKER SYMBOL; LAMBDA FUNCTION; PSEUDORANDOM NUMBER GENERATOR;

NUMBER THEORY;

EID: 0029345097     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.391261     Document Type: Article

References (9)

1. W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr, “RSA and Rabin functions: Certain parts are as hard as the whole,” SIAM J. Comput., vol. 17, pp. 194–209, 1988.
2. M. Blum, “Coin flipping by telephone: A protocol for solving impossible problems,” SIGACT News (ACM Press), vol. 15, pp. 23–27, 1983.
3. L. Blum, M. Blum, and M. Shub, “A simple unpredictable pseudorandom number generator,” SIAM J. Comput., vol. 15, pp. 364–383, 1986.
4. Z. I. Borevich and I. R. Shafarevich, Number Theory. New York: Academic Press, 1966.
5. D. Goldfeld, “Gauss' class number problem for imaginary quadratic fields,” Bull. Amer. Math. Soc., vol. 13, pp. 23–37, 1985.
6. G. L. Miller, “Riemann's hypothesis and tests for primality,” J. Comput. Syst. Sci., vol. 13, pp. 300–317, 1976.
7. W. Narkiewicz, Elementary and Analytic Theory of Algebraic Numbers. Warsaw, Poland: Polish Scientific Publishers, 1973.
8. H. E. Rose, A Course in Number Theory. Oxford, UK: Clarendon Press, 1988.
9. J. V. Uspensky, Introduction to Mathematical Probability. New York: McGraw-Hill, 1937.