z-logo
open-access-imgOpen Access
Efficient Implementation of NTRU Cryptography using Residue Number System
Author(s) -
Azin Zalekian,
Mohammad Esmaeildoust,
Amer Kaabi
Publication year - 2015
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2015905527
Subject(s) - ntru , computer science , cryptography , computer security , theoretical computer science , cryptosystem
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 {2, 2-1, 2-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. General Terms Public Key Cryptography, NTRU cryptography, Residue Arithmetic, Residue Number System

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom