Fast hardware for modular exponentiation with efficient exponent pre-processing

Journal of Systems Architecture

Volumn 53, Issue 2-3, 2007, Pages 99-108

  Nedjah, Nadia ^a   de Macedo Mourelle, Luiza ^a  

^a STATE UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Cryptography; m ary method; Modular exponentiation

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER HARDWARE; CRYPTOGRAPHY; PERFORMANCE;

EFFICIENT EXPONENT PRE-PROCESSING; M-ARY METHOD; MODULAR EXPONENTIATION;

MOLECULAR ORIENTATION;

EID: 33846213649     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysarc.2006.09.008     Document Type: Article

References (18)

1. Rivest R., Shamir A., and Adleman L. A method for obtaining digital signature and public-key cryptosystems. Communications of the ACM 21 (1978) 120-126
2. Ç.K. Koç, High-speed RSA Implementation, Technical report, RSA Laboratories, Redwood City, CA, USA, November 1994.
3. Brickell E.F. A survey of hardware implementation of RSA. In: Brassard G. (Ed). Advances in Cryptology, Proceedings of CRYPTO'98. Lecture Notes in Computer Science vol. 435 (1989), Springer-Verlag 368-370
4. Walter C.D. Systolic modular multiplication. IEEE Transactions on Computers 42 3 (1993) 376-378
5. Montgomery P.L. Modular multiplication without trial division. Mathematics of Computation 44 (1985) 519-521
6. Nedjah N., and Mourelle L.M. Two hardware implementations for the Montgomery multiplication: sequential vs. parallel. Proc. of the 15th. Symposium on Integrated Circuits and Systems Design (2002), IEEE Computer Society Press pp. 3-8
7. Booth A. A signed binary multiplication technique. Quarterly Journal of Mechanics and Applied Mathematics (1951) 236-240
8. G.W. Bewick, Fast multiplication algorithms and implementation, Ph.D. Thesis, Department of Electrical Engineering, Stanford University, USA, 1994.
9. Walter C.D. A verification of Brickell's fast modular multiplication algorithm. International Journal of Computer Mathematics 33 (1990) 153-169
10. Eldridge S.E., and Walter C.D. Hardware implementation of Montgomery's Modular Multiplication Algorithm. IEEE Transactions on Computers 42 6 (1993) 619-624
11. Walter C.D. Montgomery exponentiations needs no final subtractions. Electronics Letter 35 21 (1999) 1831-1832
12. Hachez G., and Quisquater J.J. Montgomery exponentiations needs no final subtractions: improved results, Cryptographic Hardware and Embedded Systems. In: Paar C., and Koç C.K. (Eds). Proceedings of CHES'00. Lecture Notes in Computer Science vol. 1965 (2000), Springer-Verlag 293-301
13. Rabaey J. Digital integrated circuits: A design perspective (1995), Prentice-Hall
14. N. Nedjah, L.M. Mourelle, Yet another implementation of modular multiplication, in: Proceedings of 13th Symposium of Computer Architecture and High Performance Computing, 2001, pp. 70-75.
15. N. Nedjah, L.M. Mourelle, Reduced hardware architecture for the Montgomery modular multiplication, in: Proceedings of the third IEEE Symposium Mathematical Methods and Computational Techniques in Electrical Engineering, Athens, Greece, 2001.
16. Nedjah N., and Mourelle L.M. Reconfigurable hardware implementation of Montgomery modular multiplication and parallel binary exponentiation. Proceedings of the Euromicro Symposium on Digital System Design, Dortmund, Germany (2002), IEEE Computer Society Press pp. 226-235
17. Nedjah N., and Mourelle L.M. Efficient Pre-processing for Large Window-based Modular Exponentiation using Genetic Algorithms. Lecture Notes of Computer Science vol. 2718 (2003) 625-635
18. Xilinx™ Inc. Foundation Series, http://www.xilinx.com.