Efficient Implementation of NTRU Cryptography using Residue Number System

Abstract

The NTRU cryptography is a lattice-based public key cryptography. Encryption and decryption process in NTRU are based on polynomial multiplication. This property makes NTRU to be very fast compared to other public key cryptography algorithm such as elliptic curve cryptography and RSA. In order to fast implementation of NTRU, hardware implementation of NTRU by employing residue number system is presented. To achieve high speed implementation, balanced three moduli set {2n, 2n+1-1, 2n-1} is considered and the encryption and part of decryption process are implemented by considered RNS bases. The result shows the noticeable improvement compared to original NTRU cryptography.

Extracted Key Phrases

Cite this paper

@inproceedings{Zalekian2015EfficientIO, title={Efficient Implementation of NTRU Cryptography using Residue Number System}, author={Azin Zalekian and Mohammad Esmaeildoust and A. Kaabi and Ron L. Rivest and Ariel Shamir and D. Schinianakis and Hamid Javashi and Thanos Stouraitis and Keivan Navi and Colleen O'Rourke and A. S. Molahosseini and NTRUSign J. Hoffstein and Nicholas A. Howgrave-Graham and Jill Pipher and Joseph H. Silverman}, year={2015} }