Abstract
Elliptic Curve Cryptosystems (ECC) are becoming increasingly popular for use in mobile devices and applications where bandwidth and chip area are limited. They provide much higher levels of security per key bit than established public key systems such as RSA. The coreECCoperation of point scalar multiplication inGF(p) requires modular multiplication, division/inversion and addition/subtraction. Division is the most costly operation in terms of speed and is often avoided by performing many extra multiplications. This paper proposes a new divider architecture and FPGA implementations for use in an ECC processor.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blake, I., Seroussi, G., and Smart, N. (2000). “Elliptic Curves in Cryptography”. London Mathematical Society Lecture Note Series 265. Cambridge University Press.
Daly, A. and Marnane, W. (2002). “Efficient Architectures for Implementing Montgomery Modular Multiplication and RSA Modular Exponentiation on Reconfigurable Logic”. 10th Intl Symposium on FPGA (FPGA 2002), pages 40–49.
Daly, A., Marnane, W., and Popovici, E. (2003). “Fast Modular Inversion in the Montgomery Domain on Reconfigurable Logic”. Irish Signals and Systems Conference ISSC2003, pages 362–367.
Ernst, M., Jung, M., Madlener, F., Huss, S., and Blümel, R. (2002). “A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n)”. Cryptographic Hardware and Embedded Systems—CHES 2002, (LNCS 2523):381–398.
Gutub, A., Tenca, A. F., Savas, E., and Koc, C. K. (2002). “Scalable and unified hardware to compute Montgomery inverse in GF(p) and GF(2n)”. Cryptographic Hardware and Embedded Systems-CHES 2002, (LNCS 2523):484–499.
IEEE (2000). IEEE 1363/D13 Standard Specifications for Public Key Cryptography.
Kaliski, B. S. (1995). “The Montgomery Inverse and it's applications”. IEEE Trans. on Computers, 44(8):1064–1065.
Kerins, T., Popovici, E., Marnane, W., and Fitzpatrick, P. (2002). “Fully Parameterizable Elliptic Curve Cryptography Processor over GF(2m)”. 12thIntl Conference on Field-Programmable Logic and Applications FPL2002, pages 750–759.
Koblitz, N. (1987). “Elliptic Curve Cryptosystems”. Math Comp, 48:203–209.
Miller, V. S. (1985). “Use of Elliptic Curves in Cryptography”. Advances in Cryptography Crypto'85, (218):417–426.
Orlando, G. and Paar, C. (2001). “A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware”. Cryptographic Hardware and Embedded Systems-CHES 2001, (LNCS 2162):348–363.
Savas, E. and Koc, C. K. (2000). “The Montgomery Modular Inverse—Revisited”. IEEE Trans. on Computers, 49(7):763–766.
Shantz, S. C. (2001). “From Euclid's GCD to Montgomery Multiplication to the Great Divide”. Technical Report TR-2001-95, Sun Microsystems Laboratories. Laboratories.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer
About this chapter
Cite this chapter
Daly, A., Marnane, W., Kerins, T., Popovici, E. (2005). Division in GF(p) for Application in Elliptic Curve Cryptosystems on Field Programmable Logic. In: Lysaght, P., Rosenstiel, W. (eds) New Algorithms, Architectures and Applications for Reconfigurable Computing. Springer, Boston, MA. https://doi.org/10.1007/1-4020-3128-9_18
Download citation
DOI: https://doi.org/10.1007/1-4020-3128-9_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-3127-4
Online ISBN: 978-1-4020-3128-1
eBook Packages: EngineeringEngineering (R0)