The Chinese Remainder Theorem and its application in a high-speed RSA crypto chip

Proceedings - Annual Computer Security Applications Conference, ACSAC

Volumn 2000-January, Issue , 2000, Pages 384-393

  Grossschadl J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Arithmetic; Cathode ray tubes; Clocks; Cryptography; DH HEMTs; Frequency; Hardware; Information processing; Pipeline processing; Prototypes

Indexed keywords

CATHODE RAY TUBES; CATHODES; CLOCKS; COMPUTER HARDWARE; CRYPTOGRAPHY; DATA PROCESSING; DIGITAL ARITHMETIC; HARDWARE; SECURITY OF DATA; SECURITY SYSTEMS;

CHINESE REMAINDER THEOREM; DH-HEMTS; EFFICIENT IMPLEMENTATION; FREQUENCY; MODULAR EXPONENTIATIONS; MULTIPLIER ARCHITECTURE; PIPELINE PROCESSING; PROTOTYPES;

PIPELINE PROCESSING SYSTEMS;

EID: 84949500765     PISSN: 10639527     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSAC.2000.898893     Document Type: Conference Paper

References (18)

1. P. Barrett. Implementing the Rivest, Shamir and Adleman public-key encryption algorithm on a standard digital signal processor. In A. M. Odlyzko, editor, Advances in cryptology: CRYPTO '86: proceedings, volume 263 of Lecture Notes in Computer Science, pp 311-323, Springer-Verlag, Berlin, Germany, 1987.
2. R. P. Brent and H. T. Kung. A regular layout for parallel adders. IEEE Transactions on Computers, C-31(3), pp. 260-264, 1982.
3. W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, IT-22(6) pp. 644-654, November 1976.
4. J. F. Dhem. Design of an efficient public-key cryptographic library for RISC-based smart cards. Thesis (Ph.D.), Université catholique de Louvain, Louvain-la-Neuve, Belgium, 1998.
5. D. E. Knuth. Seminumerical Algorithms, volume 2 of The Art of Computer Programming. Addison-Wesley, Reading, MA, USA, 1969.
6. N. Koblitz. A Course in Number Theory and Cryptography, volume 114 of Graduate texts in mathematics. Springer-Verlag, Berlin, Germany, second edition, 1994.
7. O. L. MacSorley. High-Speed Arithmetic in Binary Computers. Proceedings of the Institute of Radio Engineers, 49:67-91, 1961.
8. W. Mayerwieser, K. C. Posch, R. Posch, and V. Schindler. Testing a High-Speed Data Path: The Design of the RSAβ Crypto Chip. J.UCS: Journal of Universal Computer Science, 1(11) pp. 728-744, November 1995.
9. A. J. Menezes, P. C. Van Oorschot, and S. A. Vanstone. Handbook of applied cryptography. The CRC Press series on discrete mathematics and its applications. CRC Press, Boca Raton, FL, USA, 1997.
10. National Institute of Standards and Technology (NIST). FIPS Publication 186: Digital Signature Standard. National Institute for Standards and Technology, Gaithersburg, MD, USA, May 1994.
11. K. C. Posch and R. Posch. Approaching encryption at ISDN speed using partial parallel modulus multiplication. IIG report 276, Institutes for Information Processing Graz, Graz, Austria, November 1989.
12. J.-J. Quisquater and C. Couvreur. Fast decipherment algorithm for RSA public-key cryptosystem. IEE Electronics Letters, 18(21), pp. 905-907, October 1982.
13. J. M. Rabaey. Digital Integrated Circuits - A Design Perspective. Prentice Hall Electronics and VLSI Series, Prentice Hall, Upper Saddle River, NJ, USA, 1996.
14. R. L. Rivest, A. Shamir, and L. Adleman. A Method for Obtaining Digital Signatures and Public Key Cryptosystems. Communications of the Association for Computing Machinery, 21(2) pp. 120-126, February 1978.
15. V. Schindler. A low-power true single phase clocked (TSPC) full-adder. Proceedings of the 22nd ESSCIRC, Neuchâtel, Switzerland, pp. 72-75, 1996.
16. M. Shand and J. Vuillemin. Fast Implementation of RSA Cryptography. Proceedings of 11th Symposion on Computer Arithmetic, 1993.
17. C. S. Wallace. A suggestion for a fast multiplier. IEEE Transactions on Electronic Computation, EC-13(1), pp. 14-17, 1964.
18. J. Yuan and C. Svensson. High-speed CMOS circuit technique. IEEE Journal of Solid-State Circuits, 24(1), pp. 62-70, 1989.