Public-key encryption based on Chebyshev polynomials

Circuits, Systems, and Signal Processing

Volumn 24, Issue 5 SPEC. ISS., 2005, Pages 497-517

  Kocarev, L ^a   Makraduli, J ^b   Amato, Paolo ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b SS CYRIL AND METHODIUS UNIVERSITY   (Macedonia)

^c STMICROELECTRONICS   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHEBYSHEV APPROXIMATION; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MATRIX ALGEBRA; POLYNOMIALS; RANDOM PROCESSES; SECURITY OF DATA;

CHEBYSHEV POLYNOMIALS; PUBLIC KEY ENCRYPTION ALGORITHMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 29244435793     PISSN: 0278081X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00034-005-2403-x     Document Type: Article

References (35)

1. L. M. Pecora and T. L. Carroll, Synchronization in chaotic systems, Phys. Rev. Lett., vol. 64, pp. 821-824, 1990.
2. G. Kolumban, M. P. Kennedy, G. Kis, and Z. Jako, FM-DCSK: A novel method for chaotic communications, ISCAS '98. Proceedings of the 1998 IEEE International Symposium on Circuits and Systems, vol. 4, pp. 477-480, 1998.
3. M. Sushchik, N. Rulkov, L. Larson, L. Tsimring, H. Abarbanel, K. Yao, and A. Volkovskii, Chaotic pulse position modulation: A robust method of communicating with chaos, IEEE Commun. Lett., vol. 4, no. 4, pp. 128-130, 2000.
4. L. Kocarev, Chaos-based cryptography: A brief overview, IEEE Circuits Systems Magazine, vol. 1, no. 3, pp. 6-21, 2001.
5. F. Dachselt and W. Schwarz, Chaos and cryptography, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 48, no. 12, pp. 1498-1509, 2001.
6. M. P. Kennedy, G. Kolumban, G. Kis, and Z. Jako, Performance evaluation of FM-DCSK modulation in multipath environments, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 47, no. 12, pp. 1702-1711, 2000.
7. N. F. Rulkov, M. M. Sushchik, L. S. Tsimring, and A. R. Volkovskii, Digital communication usnig chaotic pulse position modulation, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 48. no. 12, pp. 1436-1444, 2001.
8. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, Boca Raton, FL, 1997.
9. F. Pichler and J. Scharinger, Finite dimensional generalized Baker dynamical systems for cryptographic applications, Lect. Notes in Comput. Sci., vol. 1030, pp. 465-476, 1996.
10. J. Fridrich, Symmetric ciphers based on two-dimensional chaotic maps, Internat. J. Bifur. Chaos, vol. 8, no. 6, pp. 1259-1284, 1998.
11. G. Jakimoski and L. Kocarev, Chaos and cryptography: block encryption ciphers based on chaotic maps, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 48, no. 2, pp. 163-169, 2001.
12. G. Jakimoski and L. Kocarev, Differential and linear probabilities of a block-encryption cipher, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 50, no. 1, pp. 121-123, 2003.
13. N. Masuda and K. Aihara, Cryptosystems with discretized chaotic maps, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 49, no. 1, pp. 28-40, 2002.
14. R. A. J. Matthews, On the derivation of a 'chaotic' encryption algorithm, Cryptologia, vol. 13, pp. 29-42, 1989
15. D. D. Wheeler, Problems with chaotic cryptosystems, Cryptologia, vol. 13, pp. 243-250, 1989
16. D. D. Wheeler and R. A. J. Matthews, Supercomputer investigations of a chaotic encryption algorithm, Cryptologia, vol. 15, no. 2, pp. 140-152, 1991.
17. T. Kohda and A. Tsuneda, Statistics of chaotic binary sequences, IEEE Trans. Inform. Theory, vol. 43, pp. 104-112, 1997.
18. L. Kocarev and G. Jakimoski, Pseudorandom bits generated by chaotic maps, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 50, no. 1, pp. 123-126, 2003.
19. C. S. Petrie and J. A. Connelly, A noise-based IC random number generator for applications in cryptography, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 47, no. 5, pp. 615-621, 2000.
20. T. Stojanovski and L. Kocarev, Chaos-based random number generators-part I: Analysis, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 48, no. 3, pp. 281-288, 2001.
21. T. Stojanovski, J. Pihl and L. Kocarev, Chaos-based random number generators PART II: Practical realization, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 48, no. 3, pp. 382-385, 2001.
22. A. Gerosa, R. Bernardini, and S. Pientri, A fully integrated chaotic system for the generation of truly random numbers, IEEE Trans. Circuits Systems I: Fund. Theory Appl., vol. 49, no. 7, pp. 993-1000, 2002.
23. L. Kocarev and Z. Tasev, Public-key encryption based on Chebyshev maps, 2003 IEEE International Symposium on Circuits and Systems, May 25-28, 2003, Bangkok, Thailand, ISCAS 2003, accepted for publication.
24. L. Kocarev, Z. Tasev, and J. Makraduli, Public-key encryption and digital-signature schemes using chaotic maps, 16th European Conference on Circuits Theory and Design, September 1-4, 2003, Krakow, Poland, ECCTD 2003, accepted for publication.
25. C. E. Shannon, Communication theory of secrecy systems, Bell Syst. Tech. J., vol. 28, pp. 656-715, 1949.
26. C. E. Shannon, Bell Syst. Tech. J., vol. 27, no. 379, 1948;
27. C. E. Shannon, Bell Syst. Tech. J., vol. 27, no. 623, 1948.
28. W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory, vol. 22, pp. 644-654, 1976.
29. T. J. Rivlin, Chebyshev Polynomials, Wiley, New York, 1990.
30. I. Percival and F. Vivaldi, Arithmetical properties of strongly chaotic motions, Physica D, vol. 25, nos. 1-3, pp. 105-130, 1987.
31. H. Cohn, A Second Course in Number Theory, Wiley, New York, 1962.
32. H. Hasse, Number Theory, Springer-Verlag, Berlin, 2002.
33. D. E. Knuth, The Art of Computer Programming, vol. 2, Addison Wesley, Reading, MA: 1998.
34. http://java.sun.com
35. www.swox.com/gmp/