IEEE Transactions on Computers · 2003 · 26 citations · 9 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputer ArchitectureCryptographyCryptographic AlgorithmsCryptographic ArchitectureElliptic Curve CryptographyElliptic CurvesModular ArithmeticDiffie-hellman Key ExchangeElliptic Curve ArithmeticInteger MultiplicationModular Arithmetic AlgorithmsModular Arithmetic In CryptographyModular MultiplicationNtru CryptosystemRsa Cryptosystem
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.
9
New directions in cryptography
Whitfield Diffie, Martin E. Hellman · IEEE Transactions on Information Theory · 1976 · 14.4K citations
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
Modular Multiplication Without Trial Division
Peter L. Montgomery · Mathematics of Computation · 1985 · 1.1K citations · Full text