Title :
Achieving NTRU with Montgomery multiplication
Author :
O´Rourke, Colleen ; Sunar, Berk
Author_Institution :
Weapons Syst. Design Lab., Raytheon Electron. Syst., Tewksbury, MA, USA
fDate :
4/1/2003 12:00:00 AM
Abstract :
We propose a new unified architecture that utilizes the Montgomery multiplication algorithm to perform a modular multiplication for both integers and binary polynomials and NTRU´s polynomial multiplications. The unified design is capable of supporting a majority of public-key cryptosystems such as NTRU, RSA, Diffie-Hellman key exchange, and elliptic curve schemes, among others. Furthermore, the architecture is highly efficient in terms of area and speed.
Keywords :
algorithm theory; computer architecture; polynomials; public key cryptography; Diffie-Hellman key exchange; Montgomery multiplication algorithm; NTRU polynomial multiplications; RSA; area; binary polynomials; elliptic curve schemes; integers; modular multiplication; public-key cryptosystems; speed; unified architecture; Algorithm design and analysis; Arithmetic; Elliptic curve cryptography; Elliptic curves; Galois fields; Pipeline processing; Polynomials; Public key cryptography; Resource management; Switches;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2003.1190585
