By Topic

Achieving NTRU with Montgomery multiplication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
O'Rourke, C. ; Weapons Syst. Design Lab., Raytheon Electron. Syst., Tewksbury, MA, USA ; Sunar, B.

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.

Published in:

Computers, IEEE Transactions on  (Volume:52 ,  Issue: 4 )