Abstract
The ever increasing demand for security in portable, energyconstrained environments that lack a coherent security architecture has resulted in the need to provide energy efficient hardware that is algorithm agile. We demonstrate the feasibility of utilizing domain-specific reconfigurable processing for asymmetric cryptographic applications in order to satisfy these constraints. An architecture is proposed that is capable of implementing a full suite of finite field arithmetic over the integers modulo-N, binary Galois Fields, and non-supersingular elliptic curves over GF(2n), with operands ranging in size from 8 to 1024 bits. The performance and energy efficiency of the architecture are estimated via simulation and compared to existing solutions (e.g., software and FPGA’s), yielding approximately two orders of magnitude reduction in energy consumption at comparable levels of performance and flexibility.
The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the Defense Advanced Research Projects Agency (DARPA), the Air Force Research Laboratory, or the U.S. Government.
Chapter PDF
Similar content being viewed by others
Keywords
- Elliptic Curve
- Field Programmable Gate Array
- Defense Advance Research Project Agency
- Modular Exponentiation
- Defense Advance Research Project Agency
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
IEEE P1363, “Standard specifications for public-key cryptography-Draft 13,” IEEE, November 12, 1999.
Xilinx Corporation, Virtex-E Field Programmable Gate Arrays (XCV00) Databook,1999.
Altera Corporation, APEX 20K Programmable Logic Device Family Data Sheet,2000.
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.
Xilinx Corporation, XC4000 Field Programmable Gate Arrays: ProgrammableLogic Databook, 1996.
FIPS 180-1, “Secure hash standard,” Federal Information Processing StandardsPublication 180-1, U.S. Department of Commerce/N.I.S.T., National TechnicalInformation Service, Springfield, Virginia, April 17, 1995.
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.
P. Montgomery, “Modular multiplication without trial division,” Mathematics ofComputation, 48 (1987), 243–264
E.D. Mastrovito, VLSI Architectures for Computation in Galois Fields, Ph.D. Thesis,Linköping University, Linköping, Sweden, 1991.
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, January1986, 62–66.
D.E. Knuth, The Art of Computer Programming-Volume 2: Seminumerical Al-gorithms, Addison-Wesley, Reading MA, 2nd Edition, 1981.
D.M. Gordon, “A survey of fast exponentiation methods,” Journal of Algorithms,vol. 27, no. 1, April 1998, 129–146.
G. Seroussi, N.P. Smart, and I.F. Blake, Elliptic Curve Cryptography,CambridgeUniversity Press, February 2000.
Synopys Corporation, TimeMill User’s Manual, 1999.
Synopsys Corporation, PowerMill User’s Manual, 1999.
Intel Corporation, StrongARM SA-1100 Microprocessor for Portable ApplicationsBrief Datasheet, September 1999.
M. Rosner, Elliptic Curve Cryptosystems on Reconfigurable Hardware, Master’s Thesis, Worcester Polytechnic Institute, Worcester MA, 1998.
T. Blum, Modular Exponentiation on Reconfigurable Hardware, Master’s Thesis,Worcester Polytechnic Institute, Worcester MA, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goodman, J., Chandrakasan, A. (2000). An Energy Efficient Reconfigurable Public-Key Cryptography Processor Architecture. In: Koç, Ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems — CHES 2000. CHES 2000. Lecture Notes in Computer Science, vol 1965. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44499-8_13
Download citation
DOI: https://doi.org/10.1007/3-540-44499-8_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41455-1
Online ISBN: 978-3-540-44499-2
eBook Packages: Springer Book Archive