Issue No.04 - April (2003 vol.52)
Berk Sunar , IEEE
<p><b>Abstract</b>—In this paper, 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.</p>
Cryptography, NTRU, unified architectures, Montgomery multipliers, Montgomery multiplication, finite fields.
Colleen O'Rourke, Berk Sunar, "Achieving NTRU with Montgomery Multiplication", IEEE Transactions on Computers, vol.52, no. 4, pp. 440-448, April 2003, doi:10.1109/TC.2003.1190585