DocumentCode
2222270
Title
Applying Extended Chebyshev Polynomials to Construct a Trap-Door One-Way Function in Real Field
Author
Yang Jianli ; Wang Dahu
Author_Institution
Sch. of Resources & Safety Eng., China Univ. of Min. & Technol., Beijing, China
fYear
2009
fDate
26-28 Dec. 2009
Firstpage
1680
Lastpage
1682
Abstract
In this paper, the characteristics of Chebyshev Polynomials are analysed and the key point is the feature of semi-group, which might be applied in the cryptography. Next, we extend Chebyshev polynomials from real field to finite field, and propose a trap-door one-way function. According to the proposed function, a secure and practical encryption scheme is given and the feasibility and security of the scheme is discussed. In the end, we conclude that the cryptography algorithm is rational and practical.
Keywords
Chebyshev approximation; cryptography; polynomial approximation; Chebyshev polynomial; cryptography; encryption; finite field; real field; security; semigroup; trap-door one-way function; Automation; Chebyshev approximation; Cryptography; Electrical safety; Galois fields; Information science; Polynomials; Public key; Random number generation; Security;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Science and Engineering (ICISE), 2009 1st International Conference on
Conference_Location
Nanjing
Print_ISBN
978-1-4244-4909-5
Type
conf
DOI
10.1109/ICISE.2009.343
Filename
5455107
Link To Document