Abstract
In this paper we present an Elliptic Curve Point Multiplication processor over base fields GF(2m), suitable for use in a wide range of commercial cryptography applications. Our design operates in a polynomial basis is fully parameterizable in the irreducible polynomial and the chosen Elliptic Curve over any base Galois Field up to a given size. High performance is achieved by use of a dedicated Galois Field arithmetic coprocessor implemented on FPGA. The underlying FPGA architecture is used to increase calculation performance, taking advantage of the properties of this kind of programmable logic device to perform the large number of logical operations required. We discuss the performance of our processor for different Elliptic Curves and compare the results with recent implementations in terms of speed and security.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
V. S. Miller: Use of Elliptic Curves in Cryptography. Advances in Cryptology Crypto’85, Lecture Notes in Computer Science No. 218, Springer-Verlag Berlin, (1985) 417–426.
N. Koblitz: Elliptic Curve Cryptosystems. Math Comp Vol. 48, (1987) 203–209.
I. Blake, G. Seroussi, N. Smart: Elliptic Curves in Cryptography, London Mathematical Society Lecture Note Series 265, Cambridge University Press (2000).
G. B. Agnew, R. C. Mullin, S. A. Vanstone: An implementation of elliptic curve cryptosystems over F 2155, IEEE Transactions on Selected Areas in Communications. Vol. 11, (1993) 804–813.
T. Kerins, E. Popovici, A. Daly, W. Marnane: Hardware Encryption Engines for E-Commerce, Proceesings of Irish Signals and Systems Conference (2002) 89–94.
A. Dandalis, V. K. Prasanna: FPGA based cryptography for Internet Security, Online Syposium for Electronic Engineers, Nov 2000.
M. Rosner: Elliptic Curve Cryptosystems on Reconfigurable Hardware, Masters Thesis, ECE Dept., Worchester Polytechnic Institute, Worchester USA (1998).
P. Gaudry, F. Hess, N. P. Smart: Constructive and Destructive Facets of Weil Descent on Elliptic Curves, Journal of Cryptology, Vol. 15, No.1 (2002) 19–46.
D. Hankerson J. L. Hernadez A. Menezes: Software Implementation of Elliptic Curve Cryptography Over Binary fields, Proceeeding of CHES 2000, Lecture Notes in Computer Science, 1965 Springer-Verlag, (2000) 1–24.
G. Orlando, C. Paar: A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m), Proceedings of CHES 2000, Lecture Notes in Computer Science 1965, Springer-Verlag (2000). 41–56
K. H. Leung, K. W. Ma K. W. Wong P. H. W. Leong: FPGA implementation of a Microcoded Elliptic Curve Cryptographic Processor: Proceedings of Field Field-Programmable Custom Computing Machines (2000). 68–76
E. M. Popovici, P. Fitzpatrick: Algorithm and Architecture for a Galois Field Multiplicative Arithmetic Processor, submitted IEEE Trans on Information Theory Jan 2002.
A. G. Popovici: Reconfigurable Computing, Masters Thesis, National Microelectronics Research Centre, Cork Ireland. (2001).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kerins, T., Popovici, E., Marnane, W., Fitzpatrick, P. (2002). Fully Parameterizable Elliptic Curve Cryptography Processor over GF(2m). In: Glesner, M., Zipf, P., Renovell, M. (eds) Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream. FPL 2002. Lecture Notes in Computer Science, vol 2438. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46117-5_77
Download citation
DOI: https://doi.org/10.1007/3-540-46117-5_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44108-3
Online ISBN: 978-3-540-46117-3
eBook Packages: Springer Book Archive