Font Size: a A A

Optimizations And Applications Of NTRU

Posted on:2007-10-06Degree:MasterType:Thesis
Country:ChinaCandidate:Y F ChenFull Text:PDF
GTID:2178360182495734Subject:Applied Mathematics
Abstract/Summary:PDF Full Text Request
The NTRUEncrypt Public Key cryptosystem was developed over a period of several years in 1996 by a team of mathematicians (Jeffrey Hoffstein, Jill Pipher and Joseph Silverman).The security of NTRU is based on the Closest Vector Problem (CVP).The development of NTRUEncrypt Algorithm is one of the most importantachievements in cryptography. NTRU has solved the bottleneck of PKCS ------speed, which greatly prompts its wide application and will become one of the most excellent PKCS, and it has at least the same level of security as the RSA and ECC.In this paper, the basic principle of NTRU is introduced, and then on the basis of the trait of NTRU algorithm, the Star Multiply algorithm, which is the most time-consuming algorithm of the NTRU, is optimized. Thus, a "Splitting Recursive Algorithm" is introduced, which greatly reduces the costly multiplication operations and makes the whole system runs more rapidly and performs better than ever.With the development and application of the e-business and the wireless communication, the desire for network security becomes stronger than ever. Based on this, a key exchange protocol based NTRU and a mutual authentication protocol based on NTRU for wireless communication are introduced, compared with the past protocols which have to run the exponential operation of time-consuming and make the whole system run much slowly, our two protocols have the merits of improvedsecurity, faster speed of disposal, much less requirement for system and much less demand of bandwidth.
Keywords/Search Tags:NTRU Public Key Cryptosystem, CVP, cryptography
PDF Full Text Request
Related items