Analysis and Implementation on NTRU Public Key Cryptosystem
Shanyue Bu
Abstract
Shanyue Bu
Abstract
This paper introduces a new public key cryptosystem which is called NTRU algorithm. The security of the NTRU is based on the hard mathematical problem of finding very short vectors in lattices of very high dimension. The principal objects used by the NTRU PKCS are polynomial of degree N-1 having integer coefficient which are operated by addition,subtraction and multiplication etc. Encryption and decryption with NTRU are extremely fast and key creation is fast and easy. Because of their security and efficiency, the NTRU will be used widely in the future. ;;;
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper introduces a new public key cryptosystem which is called NTRU algorithm. The security of the NTRU is based on the hard mathematical problem of finding very short vectors in lattices of very high dimension. The principal objects used by the NTRU PKCS are polynomial of degree N-1 having integer coefficient which are operated by addition,subtraction and multiplication etc. Encryption and decryption with NTRU are extremely fast and key creation is fast and easy. Because of their security and efficiency, the NTRU will be used widely in the future. ;;;
Key concepts: NTRU, Computer science, Cryptosystem, Public-key cryptography, Post-quantum cryptography, Theoretical computer science, Encryption, Computer security