Achieving NTRU with Montgomery Multiplication

@article{ORourke2003AchievingNW,
  title={Achieving NTRU with Montgomery Multiplication},
  author={Colleen O'Rourke and Berk Sunar},
  journal={IEEE Trans. Computers},
  year={2003},
  volume={52},
  pages={440-448}
}
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. 
Highly Cited
This paper has 22 citations. REVIEW CITATIONS