An energy efficient reconfigurable public-key cryptography processor architecture

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1965, Issue , 2000, Pages 175-190

  Goodman, James ^a   Chandrakasan, Anantha ^b  

^a Chrysalis ITS   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER HARDWARE; COMPUTER SOFTWARE; CRYPTOGRAPHY; EMBEDDED SYSTEMS; ENERGY UTILIZATION; HARDWARE; HARDWARE SECURITY; PUBLIC KEY CRYPTOGRAPHY; RECONFIGURABLE ARCHITECTURES;

CRYPTOGRAPHIC APPLICATIONS; ENERGY-CONSTRAINED; FINITE FIELD ARITHMETIC; NON-SUPERSINGULAR; ORDERS OF MAGNITUDE; PROCESSOR ARCHITECTURES; RECONFIGURABLE PROCESSING; SECURITY ARCHITECTURE;

ENERGY EFFICIENCY;

EID: 68549107605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. IEEE P1363, “Standard specifications for public-key cryptography-Draft 13,” IEEE, November 12, 1999.
2. Xilinx Corporation, Virtex-E Field Programmable Gate Arrays (XCV00) Databook, 1999.
3. Altera Corporation, APEX 20K Programmable Logic Device Family Data Sheet, 2000.
4. E. Kusse and J. Rabaey, “Low-energy embedded FPGA structures,” ISLPED’98-Proceedings of the 1998 International Symposium on Low Power Electronic Design, 1998, 155-160.
5. Xilinx Corporation, XC4000 Field Programmable Gate Arrays: Programmable Logic Databook, 1996.
6. FIPS 180-1, “Secure hash standard,” Federal Information Processing Standards Publication 180-1, U.S. Department of Commerce/N.I.S.T., National Technical Information Service, Spring_eld, Virginia, April 17, 1995.
7. A. Satoh, et. al., “A high-speed small RSA encryption LSI with low power dissipation,” ISW’97-Proceedings of First International Information Security Workshop, 1998, 174-187.
8. P. Montgomery, “Modular multiplication without trial division,” Mathematics of Computation, 48 (1987), 243-264
9. E.D. Mastrovito, VLSI Architectures for Computation in Galois Fields, Ph.D. Thesis, Linköping University, Linköping, Sweden, 1991.
10. P.A. Scott, S.E. Tavares, and L.E. Peppard, “A fast VLSI multiplier for GF(2m),” IEEE Journal on Selected Areas of Communications, vol. SAC-4, no.1, January 1986, 62-66.
11. D.E. Knuth, The Art of Computer Programming-Volume 2: Seminumerical Al-gorithms, Addison-Wesley, Reading MA, 2nd Edition, 1981.
12. D.M. Gordon, “A survey of fast exponentiation methods,” Journal of Algorithms, vol. 27, no. 1, April 1998, 129-146.
13. G. Seroussi, N.P. Smart, and I.F. Blake, Elliptic Curve Cryptography, Cambridge University Press, February 2000.
14. Synopys Corporation, TimeMill User’s Manual, 1999.
15. Synopsys Corporation, PowerMill User’s Manual, 1999.
16. Intel Corporation, StrongARM SA-1100 Microprocessor for Portable Applications Brief Datasheet, September 1999.
17. M. Rosner, Elliptic Curve Cryptosystems on Reconfigurable Hardware, Master’s Thesis, Worcester Polytechnic Institute, Worcester MA, 1998.
18. T. Blum, Modular Exponentiation on Reconfigurable Hardware, Master’s Thesis, Worcester Polytechnic Institute, Worcester MA , 1999.