Achieving NTRU with montgomery multiplication
Colleen Marie O'Rourke, Berk Sunar · IEEE Transactions on Computers · 2003
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.