Designing security for number sequences generated by means of the sawtooth chaotic map

IEEE Transactions on Circuits and Systems I: Regular Papers

Volumn 53, Issue 5, 2006, Pages 1140-1150

  Jessa, Mieczysław ^a  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Arbitrary order sequences; Chaos; Pseudorandom generators; Sawtooth map; Security

Indexed keywords

CHAOS THEORY; ELECTRIC POWER SYSTEMS; MATHEMATICAL MODELS; NUMBER THEORY; SYSTEMS ANALYSIS;

ARBITRARY-ORDER SEQUENCES; CHAOTIC MAP; NUMBER SEQUENCES; PSEUDORANDOM GENERATORS; SAWTOOTH MAP;

ELECTRIC GENERATORS;

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

References (30)

1. J. Argyris, G. Faust, and M. Haase, An Exploration of Chaos, Texts on Computational Mathematics. Amsterdam, The Netherlands: Elsevier Science B.V, 1994, vol. VII.
2. G. M. Berstain and M. A. Lieberman, "Secure random-number generation," IEEE Trans. Circuits Syst., vol. 37, no. 12, pp. 1157-1164, Dec. 1990.
3. P. M. Binder and R. V. Jensen, "Simulating chaotic behavior with finite-state machines," Phys. Rev A, vol. 34, pp. 4460-4463, Nov. 1986.
4. P. Bratley, B. L. Fox, and L. E. Schrage, A Guide to Simulation. New York: Springer-Verlag, 1991, ch. 6.
5. J. Boyar, "Inferring sequences produced by pseudorandom number generators," J. Assoc. Comput. Mach., vol. 36, no. 1, pp. 129-142, Jan. 1989.
6. J. Boyar, "Inferring sequences produced by a linear congruential generator missing low-order bits," J. Crypt., vol. 1, no. 3, pp. 177-184, Mar. 1989.
7. A. M. Frieze, J. Hastad, R. Kannan, J. C. Lagarias, and S. Shamir, "Reconstructing truncated integer variables satisfying linear congruencies," SIAM J. Comput., vol. 17, no. 2, pp. 262-280, Apr. 1988.
8. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, A Foundation for Computer Science. Reading, MA: Addison-Wesley, 1994, ch. 3.
9. H. Ishikawa, "Uber die Verteilung der Primzahlen," Sci. Rep. Tokyo Bunrika Daigaku, vol. A, no. 2, pp. 27-40, 1934.
10. M. Jessa, "The period of sequences generated by tent-like maps," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 49, no. 1, pp. 84-89, Jan. 2002.
11. D. E. Knuth, The Art of Computer Programming. Reading, MA: Addison Wesley, 1981, vol. 2, ch. 3.
12. D. E. Knuth, "Deciphering a linear congruential encryption," IEEE Trans. Inf. Theory, vol. IT-31, no. 1, pp. 49-52, Jan. 1985.
13. T. Kohda and A. Tsuneda, "Pseudonoise sequences by chaotic nonlinear maps and their correlation properties," IEICE Trans. Commun., vol. E76-B, pp. 855-862, Aug. 1993.
14. T. Kohda and A. Tsuneda, "Statistics of chaotic binary sequences," IEEE Trans. Inf. Theory, vol. 43, no. 1, pp. 104-112, Jan. 1997.
15. H. Krawczyk, "How to predict congruential generators," J. Algorith., vol. 13, no. 4, pp. 527-545, Dec. 1992.
16. T. Lin and L. O. Chua, "A new class of pseudorandom number generator based on chaos in digital filters," Int. J. Circuit Theory Appl., vol. 21, pp. 473-480, Sep. 1993.
17. Handbook of Applied Cryptography, CRC, Boca Raton, FL, 1997. A. J. Menezes, P. C. van Oorschot and S. C. Vanstone.
18. H.-O. Peitgen, H. Jürgens, and D. Saupe, "Chaos and Fractals," in New Frontiers of Science. New York: Springer-Verlag, 1992, ch. 10.
19. J. B. Plumstead, "Inferring a sequence generated by a linear congruence," in Proc. IEEE 23rd Symp. Found. Comp. Sci., 1982, pp. 153-159.
20. B. Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C. New York: Wiley, 1996, ch. 16.
21. M. S. Schroeder, Number Theory in Science and Communication. New York: Springer, 1999, ch. 27.
22. H. G. Schuster, Deterministic Chaos. An Introduction. Weinhem, Germany: VCH Verlagsgesellschaft, 1988, ch. 5.
23. C. E. Shannon, "Communication theory of secrecy systems," in Claude Elwood Shannon, Collected Papers, N. J. A. Sloane and A. D. Wyner, Eds. New York: IEEE Press, 1993, pp. 84-143.
24. J. Stern, "Secret linear congruential generators are not cryptographically secure," in Proc. IEEE 28th Symp. Found. Comp. Sci., 1987, pp. 421-426.
25. D. R. Stinson, Cryptography, Theory and Practice. Boca Raton, FL: CRC, 2002, ch. 2.
26. T. Stojanovski and L. Kocarev, "Chaos-based random number generators - Part I: Analysis," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 48, no. 3, pp. 281-288, Mar. 2001.
27. T. Stojanovski, J. Pihl, and L. Kocarev, "Chaos-based random number generators - part II: Practical realization," IEEE Trans. Circuits Syst. I, Fundam. Theory Appl., vol. 48, no. 3, pp. 382-385, Mar. 2001.
28. H. C. A. van Tilborg, Fundamentals of Cryptology, a Professional Reference and Interactive Tutorial. Boston, MA: Kluwer, 2000, ch. 13.
29. J. Reeds, "Cracking random number generator," Cryptologia, vol. 1, no. 1, pp. 20-26, Jan. 1977.
30. W. Trappe and L. C. Washington, Introduction to Cryptography with Coding. Upper Saddle River, NJ: Prentice-Hall, 2002, ch. 2.