Faster interleaved modular multiplication based on Barrett and Montgomery reduction methods

IEEE Transactions on Computers

Volumn 59, Issue 12, 2010, Pages 1715-1721

  Knežević, Miroslav ^a   Vercauteren, Frederik ^a   Verbauwhede, Ingrid ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Barrett reduction; Modular multiplication; Montgomery reduction; public key cryptography

Indexed keywords

BARRETT REDUCTION; ELLIPTIC CURVE CRYPTOGRAPHY; HARDWARE ARCHITECTURE; HARDWARE IMPLEMENTATIONS; INTERLEAVED MODULAR MULTIPLICATION; MODULAR MULTIPLICATION; MODULAR MULTIPLIERS; MODULAR REDUCTION; MONTGOMERY; MONTGOMERY REDUCTION; MONTGOMERY REDUCTION METHODS; PROPOSED ARCHITECTURES; PUBLIC-KEY CRYPTOSYSTEMS; RSA CRYPTOSYSTEMS; SECURITY POINT; STANDARD SOLUTIONS;

FREQUENCY MULTIPLYING CIRCUITS; HARDWARE;

PUBLIC KEY CRYPTOGRAPHY;

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

References (26)

1. ANSI, "ANSI X9.62 The Elliptic Curve Digital Signature Algorithm (ECDSA)", http://www.ansi.org, 2010.
2. R. M. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange, K. Nguyen, and F. Vercauteren, Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, 2005.
3. P. Barrett, "Communications Authentication and Security Using Public Key Encryption-A Design for Implementation", master's thesis, Oxford Univ., 1984.
4. P. Barrett, "Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor", Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO'86), pp. 311-323, 1986.
5. rq for Larger", Proc. 19th Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO'99), pp. 326-337, 1999.
6. D. Coppersmith, "Factoring with a Hint", IBM Research Report RC 19905, 1995.
7. D. Coppersmith, "Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known", Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (Eurocrypt'96), 1996.
8. D. Coppersmith, "Small Solutions to Polynomial Equations, and Low Exponent Vulnerabilities", J. Cryptology, vol. 10, no. 4, pp. 233-260, 1996.
9. J.-F. Dhem, "Modified Version of the Barrett Algorithm", technical report, 1994.
10. W. Diffie and M. E. Hellman, "New Directions in Cryptography", IEEE Trans. Information Theory, vol. IT-22, no. 6, pp. 644-654, Nov. 1976.
11. GEZEL, http://www.ee.ucla.edu/~schaum/gezel, 2010.
12. L. Hars, "Long Modular Multiplication for Cryptographic Applications", Proc. Int'l Workshop Cryptographic Hardware and Embedded Systems (CHES'04), pp. 218-254, 2004.
13. M. Joye, "RSA Moduli with a Predetermined Portion: Techniques and Applications", Proc. Information Security Practice and Experience Conf., pp. 116-130, 2008.
14. N. Koblitz, "A Family of Jacobians Suitable for Discrete Log Cryptosystems", Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO'88), pp. 94-99, 1988.
15. N. Koblitz, "Elliptic Curve Cryptosystem", Math. of Computation, vol. 48, pp. 203-209, 1987.
16. A. Lenstra, "Generating RSA Moduli with a Predetermined Portion", Proc. Advances in Cryptology (ASIACRYPT'98), pp. 1-10, 1998.
17. A. May, "New RSA Vulnerabilities Using Lattice Reduction Methods", PhD thesis, Univ. of Paderborn, 2003.
18. A. May, "Using LLL-Reduction for Solving RSA and Factorization Problems: A Survey", http://www.informatik.tu-darmstadt.de/KP/publications/ 07/lll.pdf, 2007.
19. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1997.
20. V. Miller, "Uses of Elliptic Curves in Cryptography", Proc. Ann. Int'l Cryptology Conf. Advances in Cryptology (CRYPTO'85), pp. 417-426, 1985.
21. P. Montgomery, "Modular Multiplication without Trial Division", Math. of Computation, vol. 44, no. 170, pp. 519-521, 1985.
22. National Institute of Standards and Technology. FIPS 186-2: Digital Signature Standard, Jan. 2000.
23. J.-J. Quisquater, "Encoding System According to the So-Called RSA Method, by Means of a Microcontroller and Arrangement Implementing This System", US Patent #5, 166, 978, 1992.
24. R. L. Rivest and A. Shamir, "Efficient Factoring Based on Partial Information", Proc. Workshop Theory and Application of Cryptographic Techniques on Advances in Cryptology-EUROCRYPT'85, pp. 31-34, 1986.
25. R. L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems", Comm. ACM, vol. 21, no. 2, pp. 120-126, 1978.
26. Standards for Efficient Cryptography, "Elliptic Curve Cryptography, Version 1.5, Draft", http://www.secg.org, 2005.