Area and time efficient modular multiplication of large integers

Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors

Volumn 2003-January, Issue , 2003, Pages 400-409

  Bunimov, Viktor ^a   Schimmler, Manfred ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

carry save addition; interleaved modular multiplication; Modular multiplication; Montgomery algorithm; MSB first arithmetic; redundant number arithmetic

Indexed keywords

COMPUTER ARCHITECTURE; TABLE LOOKUP;

CARRY SAVE ADDITION; INTERLEAVED MODULAR MULTIPLICATION; MODULAR MULTIPLICATION; MONTGOMERY ALGORITHM; REDUNDANT NUMBER ARITHMETIC;

ALGORITHMS;

EID: 84942511888     PISSN: 10636862     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASAP.2003.1212863     Document Type: Conference Paper

References (26)

1. J. Bajard, L. Didier, P. Kornerup, "An RNS Montgomery modular multiplication algorithm", IEEE Transactions on Computers, Vol. 47, pp. 766-776, July 1998.
2. G. R. Blakley, "A Computer Algorithm for Calculating the Product A∗B modulo M", IEEE on Computers, Vol. C-32, No. 5, pp. 497-500, May 1983.
3. T. Blum, C. Paar, "High Radix Montgomery Modular Exponentiation on Reconfigurable Hardware", IEEE Transactions on Computers, Vol. 50, No. 7, pp. 759-764, July 2001.
4. T. Blum, C. Paar, "Montgomery Modular Multiplication on Reconfigurable Hardware", 14th IEEE Symposium on Computer Arithmetic (ARITH-14), 1999.
5. E.F. Brickell, "A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography", Proc. of Crypto'82, pp. 51-60, Plenum Press 1983.
6. V. Bunimov, M. Schimmler, B. Tolg, "A Complexity-Effective Version of Montgomery's Algorithm", ISCA'02, Workshop on Complexity Effective Designs, May 2002, http://www.ee.rochester.edu:8080/~albonesi/wced02/.
7. S.E. Eldridge, C.D. Walter, "Hardware implementation of Montgomery's modular multiplication algorithm", IEEE Transaction on Computers, Vol. 42, pp. 693-699, July 1993.
8. J. Poldre, "Cryptoprocessor PLD001", Master Thesis, Department of Computer science, Tallinn Technical University, June 1998, http://www.pld.ttu.ee/~prj/master.pdf.
9. Y. S. Kim, W. S. Kang, J. R. Choi, "Implementation of 1024-bit modular processor for RSA cryptosystem", School of Electronic and Electrical Engineering, Kyungpook National University, 1370 Sankyok-Dong, Book-Gu, Taegu, Korea, 702-701, http://www.ap-asic.org/2000/proceedings/10-4.pdf.
10. D. E. Knuth, "The Art of Computer Programming", Vol. 2, Seminumerical Algorithms. Reading, MA: Addison-Wesley, 2nd printing, p. 423, Nov. 1971.
11. C. K. Koc, "RSA Hardware Implementation", RSA Laboratories, RSA Data Security, Inc. August 1995, http://security.ece.orst.edu/koc/papers/reports.html.
12. C.K. Koc, T. Acar, B.S. Kaliski, "Analyzing and Comparing Montgomery Multiplication Algorithms", IEEE Micro, pp. 26-33, June 1996.
13. S. C. Lee, "Digital Circuits and Logic Design", Prentice-Hall, Inc. Englewood Cliffs, New Jersey, 1976.
14. Menezes et al: Handbook of Applied Cryptography, CRC Press, 1997.
15. P. L. Montgomery, "Modular Multiplication Without Trial Division", Mathematics of Computation, 44, pp. 519-521, 1985.
16. H. Morita, "A Fast Modular-Multiplication Algorithm Based on a Higher Radix", NTT Communications and Information Processing Laboratories 3-9-11, Midori-cho, Musashino-shi, Tokyo, 180 Japan, http://link.springer.de/link/service/series/0558/bibs/0435/04350387.htm.
17. G. A. Orton, M. P. Roy, P. A. Scott, L. E. Peppard and S. E. Tavares, "VLSI Implementation of Public-Key Encryption Algorithms", Advances in Cryptology-CRYPTO '86, volume 263, Lecture Notes in Computer Science, pp. 277-301, August 1986, Springer-Verlag, 1987.
18. B. Schmidt, M. Schimmler, W. Adi, "Area Efficient Modular Arithmetic for Mobile Security", ICWN'02, pp. 208-214, Las Vegas, USA, 2002.
19. M. Shand, J. Vuillemin, "Fast Implementation of RSA Cryptography", Proc. 11th IEEE Symposium on Computer Arithmetic, pp. 252-259, 1993.
20. K. R. Sloan, "Comments on "A Computer Algorithm for Calculating the Product A∗B modulo M"", IEEE Transactions on Computers, Vol. C-34, No. 3, pp. 290-292, March 1985.
21. D. R. Stinson, "Cryptography, Theory and Practice", CRC Press, 1995.
22. N. Takago, "A Radix-4 Modular Multiplication Hardware Algorithm for Modular Exponentiation", IEEE Transactions on Computers, Vol. 41, No. 8, pp. 949-956, August 1992.
23. C. D. Walter, "Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli", CT-RSA 2002: San Jose, CA, USA http://link.springer.de/link/service/series/0558/bibs/2271/22710030.htm.
24. C. D. Walter, "Logarithmic Speed Modular Multiplication", Electronics Letters 30, No 17. pp. 1397-8, 1994.
25. C. Wu, Y. Chou, "General Modular Multiplication by Block Multiplication and Table Lookup", IEEE Int. Symposium on Circuits and System, ISCAS'94, pp. 295-298, 1994.
26. J. Yong-Yin, W. Burleson, "VLSI Array Algorithms and Architectures for RSA Modular Multiplication", IEEE Transactions on VLSI Systems, Vol. 5, pp. 211-217, June 1997.