Modular exponentiation using parallel multipliers

Proceedings - 2003 IEEE International Conference on Field-Programmable Technology, FPT 2003

Volumn , Issue , 2003, Pages 52-59

  Tang, S H ^a   Tsui, K S ^a   Leong, P H W ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; PUBLIC KEY CRYPTOGRAPHY;

CARRY SAVE ADDITION; CHINESE REMAINDER THEOREM; FPGA ARCHITECTURES; MODULAR EXPONENTIATION; PARALLEL MULTIPLIERS; RSA PUBLIC-KEY CRYPTOSYSTEM;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA);

EID: 34648844291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FPT.2003.1275731     Document Type: Conference Paper

References (15)

1. T. Blum and C. Paar. High-radix montgomeiy modular exponentiation on reconfigurable hardware. IEEE Transaction on Computers, 50(7):759-764, 2001.
2. S. R. Dusse and B. S. K. Jr. A cryptographic library for the motorola Asp56000. Advances in Cryptology, EUROCRYPT 90. Lecture Notes in Computer Science, 473:230-244, 1990.
3. K. Itoh, M. Takenaka, N. Torii, S. Temma, and Y. Kurihara. Fast implemenation of public-key cryptography on a DSP TMS320C6201. In In Proceedings of the First Workshop on Cryptographic Hardware and Embedded Systems (CHES), Lecture Notes in Computer Science. Springer-Verlag, 1999.
4. D. E. Knuth. The Art of Computer Programming. Volume 2, Seminumerical Algorithms. Addison Wesley, Massachusetts, 1981.
5. K. Koc. High-speed RSA implementation. Paper, RSA Laboratories, 1994.
6. P. Komerup. High-radix modular multiplication for cryptosystems. In E. E. Swartzlander, M. J. Irwin, and J. Jullien, editors, Proceedings of the 11th IEEE Symposium on Computer Arithmetic, pages 277-283, Windsor, Canada, 1993. IEEE Computer Society Press. Los Alamitos, CA.
7. P. Komerup. A systolic, linear-array multiplier for a class of right-shift algorithms. IEEE Transactions on Computers, 43(8):892-898, 1994.
8. S. Y. Kung. VLSI Array Processors. Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1988.
9. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computation, 44(170):519-521, April 1985.
10. H. Orup. Simplifying quotient determination in high-radix modular multiplication. Proc. of the 12th Symposium on Computer Arithmetic, 1995.
11. e modulo n. In Proceedings of the 10th IEEE Symposium on Computer Arithmetic, pages 26-28, Windsor, Canada, 1991. IEEE Computer Society Press, Los Alamitos, CA.
12. R. L. Rivest, A. Shamir, and L. M. Adelman, A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2):120-126, 1978.
13. M. Shand and J. E. Vuillemin. Fast implementations of RSA cryptography. In E. E. Swartzlander, M. J, Irwin, and I. Jullien, editors, Proceedings of the 11th IEEE Symposium on Computer Arithmetic, pages 252-259, Windsor, Canada, 1993. IEEE Computer Society Press, Los Alamitos, CA.
14. C.-H. Wu, J.-H. Hong, and C.-W. Wu. RSA cryptosystem design based on the Chinese remainder theorem. In Design Automation Conference, 2001. Proceedings of the ASP-DAC 2001. Asia and South Pacific, pages 391-395. IEEE, 2001.
15. Xilinx, Inc. Xilinx Vertex-II Platform FPGA Handbook, 2001.