A scalable dual mode arithmetic unit for public key cryptosystems

International Conference on Information Technology: Coding and Computing, ITCC

Volumn 1, Issue , 2005, Pages 568-573

  Crowe, Francis ^a   Daly, Alan ^a   Marnane, William ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; EMBEDDED SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; SECURITY OF DATA;

ELLIPTIC CURVE CRYPTOSYSTEMS (ECC); HARDWARE OPTIMIZATION; PUBLIC KEYS; SECURITY REQUIREMENTS;

CRYPTOGRAPHY;

EID: 24744459872     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/itcc.2005.33     Document Type: Conference Paper

References (16)

1. I. Blake, G. Seroussi, and N. Smart. Elliptic Curves in Cryptography. 265 of London Mathematical Society Lecture Notes. Cambridge University Press, 2000.
2. th International Symposium on FPGAs, pages 40-49. ACM Press, Feb 2002.
3. A. Daly, W. Marnane, T. Kerins, and E. Popovici. An FPGA Implementation of a GF(p) ALU for Encryption Processors. Elsevier Journal on Microprocessors and Microsystems (Special issue on FPGAs: Applications and Designs), 28(5-6):253-260, 2004.
4. IEEE P1363 Working Group. Standard specifications for public key cryptography. July 2004.
5. D. Knuth. The Art of Computer Programming: Seminumerical Algorithms, volume 2. Addison-Wesley, second edition, 1981.
6. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203-209, 1987.
7. P. Kocher, R.Lee, G. McGraw, A. Raghunathan, and S. Ravi. Security as a new dimension in embedded system design. In Proc. of the 41st IEEE Design Automation Conference, pages 753-760, June 2004.
8. V. S. Miller. Use of elliptic curves in cryptography. Advances in Cryptology - CRYPTO '85, 218 of Lecture Notes in Computer Science:417-426, 1985.
9. P. L. Montgomery. Modular multiplication without trial division. Mathematics of Computations, 44(170):519-521, 1985.
10. R. L. Rivest, A. Shamir, and L. Adleman. A Method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2): 120-126, 1978.
11. S. B. Örs, L. Batina, B. Preneel and J. Vandewalle. Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array. In Proc. of the 10th Reconfigurable Architectures Workshop (RAW 2003), 2003.
12. A. Satoh and K. Takano. A Scalable Dual-Field Elliptic Curve Cryptographic Processor. IEEE Transactions on Computers, 52:449-460, April 2003.
13. A. F. Tenca and C. K. Koc. A scalable architecture for modular multiplication based on Montgomery's algorithm. IEEE Transactions on Computers, 52(9): 1215-1221, Sep 2003.
14. R. Tessier and W. Burleson. Reconfigurable Computing for Digital Signal Processing: A Survey. Journal of VLSI Signal Processing, 28:7-27, May/June 2001.
15. S. Vanstone. ECC Holds Key to Next-Gen Cryptography. Technical report, Certicom Corporation, March 2004.
16. C. D. Walter. Systolic Modular Multiplication. IEEE Transactions on Computers, 42(3):376-378, March 1993.