Security of public-key cryptosystems based on Chebyshev polynomials over prime finite fields
Authors:
- 1 July 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1843-1847
Abstract
In this paper, a new definition of Chebyshev polynomials over prime finite fields is introduced. Our approach uses a finite field trigonometry and reveals some aspects concerning the security of a recently proposed public-key encryption algorithm based on those polynomials. Particularly, we show that recovering the corresponding plaintext from a given ciphertext involves the discrete logarithm problem.Keywords
This publication has 8 references indexed in Scilit:
- Security of public-key cryptosystems based on Chebyshev polynomialsIEEE Transactions on Circuits and Systems I: Regular Papers, 2005
- Public-key encryption based on Chebyshev maps2003
- Trigonometry in finite fields and a new Hartley transform2002
- Hartley number theoretic transforms2002
- Chebyshev Polynomials2002
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976