Security of public-key cryptosystems based on Chebyshev polynomials
- 25 July 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 52 (7), 1382-1393
- https://doi.org/10.1109/tcsi.2005.851701
Abstract
Chebyshev polynomials have been recently proposed for designing public-key systems. Indeed, they enjoy some nice chaotic properties, which seem to be suitable for use in Cryptography. Moreover, they satisfy a semi-group property, which makes possible implementing a trapdoor mechanism. In this paper, we study a public-key cryptosystem based on such polynomials, which provides both encryption and digital signature. The cryptosystem works on real numbers and is quite efficient. Unfortunately, from our analysis, it comes up that it is not secure. We describe an attack which permits to recover the corresponding plaintext from a given ciphertext. The same attack can be applied to produce forgeries if the cryptosystem is used for signing messages. Then, we point out that also other primitives, a Diffie-Hellman like key agreement scheme and an authentication scheme, designed along the same lines of the cryptosystem, are not secure due to the aforementioned attack. We close the paper by discussing the issues and the possibilities of constructing public-key cryptosystems on real numbers.Keywords
This publication has 27 references indexed in Scilit:
- The random oracle methodology, revisitedJournal of the ACM, 2004
- A fast chaotic cryptographic scheme with dynamic look-up tablePhysics Letters A, 2002
- Chaos and cryptographyIEEE Transactions on Circuits and Systems I: Regular Papers, 2001
- Chaos-based cryptography: a brief overviewIEEE Circuits and Systems Magazine, 2001
- Method of constructing exactly solvable chaosPhysical Review E, 1997
- Synchronization in chaotic systemsPhysical Review Letters, 1990
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- How to share a secretCommunications of the ACM, 1979
- New directions in cryptographyIEEE Transactions on Information Theory, 1976