DocumentCode :
2519078
Title :
Security of public-key cryptosystems based on Chebyshev polynomials over prime finite fields
Author :
Lima, J.B. ; De Souza, R. M Campello ; Panario, D.
Author_Institution :
Dept. of Electron. & Syst., Fed. Univ. of Pernambuco, Recife
fYear :
2008
fDate :
6-11 July 2008
Firstpage :
1843
Lastpage :
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 :
Chebyshev approximation; polynomials; public key cryptography; Chebyshev polynomials; ciphertext; discrete logarithm problem; finite field trigonometry; prime finite fields; public-key cryptosystems; public-key encryption algorithm; Algorithm design and analysis; Chebyshev approximation; Discrete transforms; Galois fields; Mathematics; Polynomials; Public key; Public key cryptography; Security; Statistics;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location :
Toronto, ON
Print_ISBN :
978-1-4244-2256-2
Electronic_ISBN :
978-1-4244-2257-9
Type :
conf
DOI :
10.1109/ISIT.2008.4595307
Filename :
4595307
Link To Document :
بازگشت