Pseudorandom bits generated by chaotic maps

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications

Volumn 50, Issue 1, 2003, Pages 123-126

  Kocarev, Ljupčo ^a   Jakimoski, Goce ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Chaos; Pseudorandom numbers

Indexed keywords

ALGORITHMS; CHAOS THEORY; FUNCTIONS; MONTE CARLO METHODS; RANDOM NUMBER GENERATION;

CHAOTIC MAPS;

CRYPTOGRAPHY;

EID: 0037214620     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2002.804550     Document Type: Article

References (22)

1. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC, 1997.
2. R. A. J. Matthews, "On the derivation of a 'chaotic' encryption algorithm," Cryptologia, vol. 13, pp. 29-42, 1989.
3. T. Kohda and A. Tsuneda, "Statistics of chaotic binary sequences," IEEE Trans. Inform. Theory, vol. 43, pp. 104-112, Jan. 1997.
4. O. Goldreich, "Modern cryptography, probabilistic proofs and pseudorandomness," in Algorithms and Combinatorics. New York: Springer-Verlag, 1998, vol. 17.
5. T. Stojanovski and L. Kocarev, "Chaos based random number generators Part I: Analysis," IEEE Trans. Circuits Syst. I, vol. 43, pp. 281-288, Mar. 2001.
6. A. Yao, "Theory and applications of trapdoor functions," in Proc. IEEE 23rd Symp. Foundations Computer Science, 1982, pp. 80-91.
7. M. Blum and S. Micali, "How to generate cryptographically storng sequences of pseudorandom bits," in Proc. IEEE 23rd Symp. Foundations Computer Science, 1982, pp. 112-117.
8. W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr, "RSA/Rabin bits are 1/2 + (1/poly(log n)) secure," in Proc. IEEE 25th Symp. Foundations of Computer Science, 1987, pp. 449-457.
9. L. Blum, M. Blum, and M. Shub, "A simple unpredictable pseudo-random number generator," SIAM J. Comput., vol. 15, pp. 364-383, 1986.
10. D. E. Knuth, The Art of Computer Programming-Seminumerical Algorithms. Reading, MA: Addison-Wesley, 1981, vol. 2.
11. J. B. Plumstead, "Inferring a sequence generated by a linear congurence," in Proc. IEEE 23rd Symp. Foundations Computer Science, 1982, pp. 153-159.
12. J. Boyar, "Inferring sequences produces by pseudo-random number generators," J. Assoc. Comput. Mach., vol. 36, pp. 129-142, 1989.
13. H. Krawczyk, "How to predict congurential generators," J. Algorith., vol. 13, pp. 527-545, 1992.
14. A. M. Frieze, J. Hastad, R. Kannan, J. C. Lagarias, and S. Shamir, "Reconstructing truncated integer variables satisfying linear congruences," SIAM J. Comput., vol. 17, pp. 262-280, 1988.
15. J. Stern, "Secret linear congruential generators are not cryptographically secure," in Proc. IEEE 28th Symp. Foundations Computer Science, 1987, pp. 421-426.
16. J. Boyar, "Inferring sequences produces by a linear congruential generator missing low-order bits," J. Crypt., vol. 1, pp. 177-184, 1989.
17. J. A. Gonzalez and R. Pino, "Chaotic and stochastic functions," Physica A, vol. 276, pp. 425-440, 2000.
18. Online. Available: http://stat.fsu.edu/-geo/diehard.html
19. B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd ed, New York: Wiley, 1996.
20. D. D. Wheeler, "Problems with chaotic cryptosystems," Cryptologia, vol. 13, pp. 243-250, 1989.
21. D. D. Wheeler and R. A. J. Matthews, "Supercomputer investigations of a chaotic encryption algorithm," Cryptologia, vol. 15, no. 2, pp. 140-152, 1991.
22. T. Stojanovski, J. Pihl, and L. Kocarev, "Chaos based random number generators Part II: Practical realization," IEEE Trans. Circuits Syst. I, vol. 43, pp. 382-385, Mar. 2001.