DocumentCode :
3445844
Title :
An Algorithm of Dynamic Patterns for NTRU
Author :
Bu Shan Yue ; Zhang Han Yan ; Wang Ruchuan
Author_Institution :
Dept. of Comput. Eng., Huaiyin Inst. of Technol., Huaiyin
fYear :
2008
fDate :
12-14 Oct. 2008
Firstpage :
1
Lastpage :
4
Abstract :
The NTRU algorithm is a public key system based on ring, its appearance opened up a new field of application and research for the public key system. In this paper, we present a new method to enhance the executive speed of NTRU algorithm. First, we analyze the polynomial coefficients to find out the distribution characteristics of patterns,such as "11", "101" and so on, which are possible to occur repetitively. Then, using greedy algorithm we determine the patterns that can be used most frequently when calculating the convolution of polynomial, and eliminating the interferential effects that polynomial coefficients would have on patterns, thereby ultimately maximize the number of patterns found in the polynomial. By using the convolution of related patterns repetitively, we speed up the key generation, as well as the encryption and decryption operation of NTRU.
Keywords :
greedy algorithms; number theory; polynomials; public key cryptography; decryption operation; encryption operation; greedy algorithm; number theory research unit algorithm; polynomial coefficients; polynomial convolution; public key system; Application software; Convolution; Greedy algorithms; Hamming weight; Heuristic algorithms; Pattern analysis; Polynomials; Public key; Public key cryptography; Random number generation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-1-4244-2107-7
Electronic_ISBN :
978-1-4244-2108-4
Type :
conf
DOI :
10.1109/WiCom.2008.1151
Filename :
4679059
Link To Document :
بازگشت