A novel unified architecture for public-key cryptography

Proceedings -Design, Automation and Test in Europe, DATE '05

Volumn 2005, Issue , 2005, Pages 52-57

  Cilardo, A ^a   Mazzeo, A ^a   Mazzocca, N ^a   Romano, L ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURAL DESIGN; CRITICAL PATH ANALYSIS; DIGITAL ARITHMETIC; FIELD PROGRAMMABLE GATE ARRAYS; HARDWARE; MATHEMATICAL MODELS;

HYBRID APPROACH; MODULAR MULTIPLICATION; MONTGOMERY TECHNIQUE; RSA;

CRYPTOGRAPHY;

EID: 33646907395     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2005.28     Document Type: Conference Paper

References (16)

1. T. Blum and C. Paar. Montgomery modular exponentiation on reconfigurable hardware. P roc. 14th Symp. Computer Arithmetic, pages 70-77, 1999.
2. T. Blum and C. Paar. High-radix Montgomery modular exponentiation on reconfigurable hardware. IEEE Trans. on Computers, 50(7):759-764, July 2001.
3. A. Cilardo. Modular exponentiation on reconfigurable hardware. Master's thesis, Università degli Studi Federico II. Napoli. January 2003. Available at http://cds.unina.it/~acilardo.
4. A. Cilardo, A. Mazzeo, L. Romano, and G. Saggese. Carry-save Montgomery modular exponentiation on reconfigurable hardware. IEEE Proc. of the Design, Automation and Test Europe (DATE) Conference, 3:206-211, February 2004.
5. A. Cilardo, A. Mazzeo, L. Romano, and G. Saggese. Exploring the design-space for FPGA-based implementation of RSA. Elsevier Microprocessors and Microsystems, 28(4):183-191, May 2004.
6. k). In Proc. of Cryptographic Hardware and Embedded Systems - Lecture Notes in Computer Science n. 2162. Springer-Verlag, Berlin. 2001.
7. IEEE-P1363. Standard Specifications For Public-Key: Cryptography. 2000.
8. D. Knuth. The Art of Computer Programming: Seminumerical Algorithms. Addison-Wesley, 1981.
9. k). Designs, Codes and Cryptography, 14(1):57-69. April 1998.
10. A. J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston, MA, 1993.
11. P. L. Montgomery. Modular multiplication without trial division. Math, of Computation, 170(44):519-521. April 1985.
12. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures. Commun. ACM, 21:120-126, 1978.
13. A. Satoh and K. Takano. A scalable dual-field elliptic curve cryptographic processor. IEEE Transactions on Computers, 4:449-460, April 2003.
14. n). IEE Proceedings - Computers and Digital Techniques, 151(2):147-160, March 2004.
15. m). International Journal of Computer Research, 2004.
16. C.D. Walter. Systolic modular multiplication. IEEE Trans. on Computers. 42(3):376-378, March 1993.