Efficient high radix modular multiplication for high-speed computing in re-configurable hardware

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn , Issue , 2005, Pages 1226-1229

  Wang, Yi ^a   Leiwo, Jussipekka ^a   Srikanthan, Thambipillai ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

FPGA; High radix; Modular multiplication; Montgomery multiplication

Indexed keywords

BIT-WIDTH; COMPUTATION TIME; EXISTING METHOD; FPGA; HIGH RADIX; HIGH SPEED COMPUTING; MODULAR EXPONENTIATIONS; MODULAR MULTIPLICATION; MONTGOMERY MULTIPLICATION; MONTGOMERY'S ALGORITHM; PUBLIC KEY CRYPTOSYSTEMS; RE-CONFIGURABLE; SIMULATION RESULT; SPEED-UP;

PUBLIC KEY CRYPTOGRAPHY;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 33847723811     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCAS.2005.1464815     Document Type: Conference Paper

References (11)

1. T. Blum and C. Paar. Brief contributions: high-radix Montgomery modular exponentiation on reconfigurable hardware. IEEE Transactions on Computers, 50(7):759-764, July 2001.
2. S. E. Eldridge and C. D. Walter. Hardware implementation of Montgomery's modular multiplication algorithm. IEEE Transaction on Computers, 42:693-699, 1993.
3. A. Menezes, P. Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1996.
4. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(5):19-21, 1985.
5. O. Nibouche, A. Bouridane, and M. Nibouche. Architectures for Montgomery's multiplication. IEEE Transactions on Computers, 52(9), 2003.
6. H. Nozaki, M. Motoyama, A. Shimbo, and S. Kawamura. Implementation of RSA algorithm based on RNS Montgomery multiplication. CHES 2001, LNCS 2162 Springer-Verlag Berlin Heidelberg, pages 364-376, 2001.
7. J. Pieprzyk, T. Hardjono, and J. Seberry. Fundamentals of Computer Security. Springer-Verlag, 2003.
8. R. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Communications of the ACM, 21:120-126, 1978.
9. D. Stinson. Cryptography: Theory and Practice. Chapmann & Hall / CRC, 2nd edition, 2002.
10. C. Y. Su, S. A. Hwang, P. S. Chen, and C. W. Wu. An improved Montgomery's algorithm for high-speed RSA public-key cryptosystem. IEEE Transction on Very Large Scale Integration(VLSI) Sytem, 7(2), 1999.
11. C. C. Yang, T. S. Chang, and C. W. Jen. A new RSA cryptosystem hardware design based on Montgomery's algorithm. IEEE Transction on circuits and Systems-: Analog Digital Signal Processing, 45(7), 1998.