Montgomery reduction algorithm for modular multiplication using low-weight polynomial form integers

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2007, Pages 230-239

  Chung, Jaewook ^a   Hasan, M Anwar ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Adapted modular number system; Low weight polynomial form integers; Montgomery reduction algorithm; More generalized Mersenne numbers; Polynomial modular number system

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; NUMBER THEORY; POLYNOMIALS;

ADAPTED MODULAR NUMBER SYSTEM; LOW WEIGHT POLYNOMIAL FORM INTEGERS; MONTGOMERY REDUCTION ALGORITHM; MORE GENERALIZED MERSENNE NUMBERS; POLYNOMIAL MODULAR NUMBER SYSTEM;

DIGITAL ARITHMETIC;

EID: 36049021578     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARITH.2007.23     Document Type: Conference Paper

References (19)

1. J. Chung and M. A. Hasan, "Low-weight polynomial form integers for efficient modular multiplication," IEEE Transactions on Computers, vol. 56, no. 1, pp. 44-57, 2007.
2. J. Chung and A. Hasan, "More generalized Mersenne numbers," in Selected Areas in Cryptography - SAC 2003, LNCS 3006, pp. 335-347, Springer-Verlag, 2003.
3. J.-C. Bajard, L. Imbert, and T. Plantard, "Modular number systems: Beyond the Mersenne family," in Selected Areas in Cryptography 2004, LNCS 3357, pp. 159-169, Springer-Verlag, 2004.
4. J.-C. Bajard, L. Imbert, and T. Plantard, "Arithmetic operations in the polynomial modular number system," in Proceedings of the 17th IEEE Symposium on Computer Arithmetic, ARITH'05, pp. 206-213, 2005.
5. A. Karatsuba and Y. Ofman, "Multiplication of multidigit numbers on automata," Soviet Physics Doklady (English translation), vol. 7, no. 7, pp. 595-596, 1963.
6. A. L. Toom, "The complexity of a scheme of functional elements realizing the multiplication of integers," Soviet Math, vol. 3, pp. 714-716, 1963.
7. S. A. Cook, On the Minimum Computation Time of Functions. PhD thesis, Harvard University, May 1966.
8. P. L. Montgomery, "Five, six, and seven-term Karatsuba-like formulae," IEEE Transaction on Computers, vol. 54, no. 3, pp. 362-369, 2005.
9. P. L. Montgomery, "Modular multiplication without trial division," Mathematics of Computation, vol. 44, no. 170, pp. 519-521, 1985.
10. P. Kocher, "Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems," in Advances in Cryptology - CRYPTO '96, LNCS 1109, pp. 104-113, Springer-Verlag, 1996.
11. W. Schindler, "A timing attack against RSA with the Chinese remainder theorem," in Cryptographic Hardware and Embedded Systems CHES 2000, LNCS 1965, pp. 109-124, Springer-Verlag, 2000.
12. C. D. Walter and S. Thompson, "Distinguishing exponent digits by observing modular subtractions," in Progress in Cryptology - CT-RSA 2001, LNCS 2020, pp. 192-207, Springer-Verlag, 2001.
13. C. D. Walter, "Montgomery exponentiation needs no final subtractions," Electronics Letters, vol. 35, no. 21, pp. 1831-1832, 1999.
14. G. Hachez and J.-J. Quisquater, "Montgomery exponentiation with no final subtractions: Improved results," in Cryptographic Hardware and Embedded Systems - CHES 2000, LNCS 1965, pp. 293-301, Springer-Verlag, 2000.
15. C. D. Walter, "Precise bounds for Montgomery modular multiplication and some potentially insecure RSA moduli," in Topics in Cryptology - CT-RSA 2002, LNCS 2271, pp. 30-39, Springer-Verlag, 2002.
16. E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Transactions on Information Theory, vol. 48, pp. 2201-2214, August 2002.
17. T. Granlund, "Instruction latencies and throughput for AMD and Intel x86 processors," 2005. Available at http://swox.com/doc/x86-timing.pdf.
18. H. Wu, M. A. Hasan, I. F. Blake, and S. Gao, "Finite field multiplier using redundant representation," IEEE Transactions on Computers, vol. 51, no. 11, pp. 1306-1316, 2002.
19. m) yielding small complexity arithmetic circuits," IEEE Transactions on Computers, vol. 47, no. 9, 1998.