Achieving NTRU with Montgomery multiplication

IEEE Transactions on Computers

Volumn 52, Issue 4, 2003, Pages 440-448

  O'Rourke, Colleen ^a   Sunar, Berk ^b  

^a RAYTHEON COMPANY   (United States)

^b WORCESTER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Cryptography; Finite fields; Montgomery multiplication; Montgomery multipliers; NTRU; Unified architecture

Indexed keywords

ADDERS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER SIMULATION; NUMBER THEORY; POLYNOMIALS; SECURITY OF DATA;

FINITE FIELDS; MONTGOMERY MULTIPLICATION; MONTGOMERY MULTIPLIERS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0037698912     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2003.1190585     Document Type: Article

References (12)

1. R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Comm. ACM, vol. 21, pp. 120-126, Feb. 1978.
2. N. Koblitz, "Elliptic Curve Cryptosystems," Math. Computation, vol. 48, pp. 203-209, 1987.
3. A.J. Menezes, Elliptic Curve Public Key Cryptosystems. Boston: Kluwer Academic, 1993.
4. J. Hoffstein, J. Pipher, and J.H. Silverman, "NTRU: A Ring Based Public Key Cryptosystem," Proc. Algorithmic Number Theory: Third Int'l Symp. (ANTS 3), J.P. Buhler, ed., pp. 267-288, June 1998.
5. P.L. Montgomery, "Modular Multiplication without Trial Division," Math. Computation, vol. 44, pp. 519-521, Apr. 1985.
6. k)," Design, Codes, and Cryptography, vol. 14, no. 1, pp. 57-69, 1998.
7. m)," Proc. Workshop Cryptographic Hardware and Embedded Systems (CHES 2000), Ç.K. Koç and C. Paar, eds., pp. 277-292, 2000.
8. G. Gaubatz, "Versatile Montgomery Multiplier Architectures," master's thesis, Electrical and Computer Eng. Dept., Worcester Polytechnic Inst., Worcester, Mass., Apr. 2002.
9. J. Hoffstein and J.H. Silverman, "Optimizations for NTRU," Proc. Public Key Cryptography and Computational Number Theory, Sept. 2000.
10. Ç.K. Koç, T. Acar, and B. Kaliski, "Analyzing and Comparing Montgomery Multiplication Algorithms," IEEE Micro, pp. 26-33, June 1996.
11. M. Graphics, "ADK HTML Data Book TSMC 0.35 Micron FAST," 2001.
12. W. Diffie and M.E. Hellman, "New Directions in Cryptography," IEEE Trans. Information Theory, vol. 22, pp. 644-654. 1976.