An efficient and scalable radix-4 modular multiplier design using receding techniques

Conference Record of the Asilomar Conference on Signals, Systems and Computers

Volumn 2, Issue , 2003, Pages 1445-1450

  Tenca, Alexandre F ^a   Tawalbeh, Lo'ai A ^a  

^a Oregon State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DATA ACQUISITION; ENCODING (SYMBOLS); EXPERT SYSTEMS; MATHEMATICAL MODELS; REDUNDANT MANIPULATORS;

KERNELS; MULTIPLIER DESIGN; RECODING TECHNIQUES; SCALABLE RADIX-4 MODULAR;

MULTIPLYING CIRCUITS;

EID: 4143116646     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. L. Adleman, R. L. Rivest, and A. Shamir, "A method for obtaining digital signature and public-key cryptosystems," Comm. of the ACM, vol. 21, no. 2, pp. 120-126, February 1978.
2. M. E. Hellman and W. Diffie, "New directions on cryptography," IEEE transactions on Information Theory, vol. 22, pp. 644-654, November 1976.
3. C. D. Walter, "Montogomery's multiplication technique: how to make it smaller and faster," in Cryptographic Hardware and Embedded Systems - CHES 1999, Ç. K. Koç and C. Paar, Eds. 1999, Lecture Notes in Computer Science, No. 1717, pp. 80-93, Springer, Berlin, Germany.
4. A. F. Tenca and C. K. Koc, "A scalable architecture for montgomery multiplication," in Cryptographic Hardware and Embedded Systems - CHES 1999, Ç. K. Koç and G. Paar, Eds. 1999. Lecture Notes in Computer Science, No. 1717, pp. 94-108, Springer, Berlin, Germany.
5. m)," in Cryptographic Hardware and Embedded Systems - CHES 2000. Ç. K. Koç and C. Paar, Eds. 2000, Lecture Notes in Computer Science, No. 1717, pp. 281-296, Springer, Berlin, Germany.
6. A. F. Tenca, G. Todorov, and Ç. K. Koç, "High-radix design of a scalable modular multiplier," in Cryptographic Hardware and Embedded Systems - CHES 2001, Ç. K. Koç and C. Paar, Eds. 2001, Lecture Notes in Computer Science, No. 1717, pp. 189-206, Springer, Berlin, Germany.
7. A. D. Booth, "A signed binary multiplication technique," Q. J. Mech. Appl. Math., vol. 4, no. 2, pp. 236-240, 1951.
8. Gael Hachez and Jean-Jacques Quisquater, "Montgomery Exponentiation with no Final Subtractions: Improved Results," in Lecture Notes in Computer Science, Çetin K. Koç and Christoh Paar, Eds., 2000, vol. 1965, pp. 293-301.
9. ASIC Design Kit. Mentor Graphics Co, "http://www.mentor.com/ partners/hep/AsicDesignKit/dsheet /ami05databook.html," .
10. G. Todorov, "ASIC design, implementation and analysis of a scalable high-radix Montgomery multiplier," Master thesis, Oregon State University, USA, December 2000.
11. L. A. Tawalbeh, "Radix-4 ASIC Design of a Scalable Montgomery Modular Multiplier using Encoding Techniques," M.S. thesis, Oregon State University, USA, October 2002.
12. B. Kurniawan, "ASIC Design and Implementation of a Parallel Exponentation Algorithm using Optimized Scalable Montgomery Multipliers," M.S. thesis, Oregon State University, USA, March 2002.