Hardware elliptic curve cryptographic processor over GF(p)

C.J. McIvor, M. McLoone, J.V. McCanny

Research output: Contribution to journalArticlepeer-review

93 Citations (Scopus)


A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced. This can perform the main prime field arithmetic functions needed in these cryptosystems including modular inversion and multiplication. This is based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation. The processor described uses a full-word multiplier which requires much fewer clock cycles than previous methods, while still maintaining a competitive critical path delay. The benefits of the approach have been demonstrated by utilizing these techniques to create a field-programmable gate array (FPGA) design. This can perform a 256-bit prime field scalar point multiplication in 3.86 ms, the fastest FPGA time reported to date. The ECC architecture described can also perform four different types of modular inversion, making it suitable for use in many different ECC applications.
Original languageEnglish
Pages (from-to)1946-1957
Number of pages12
JournalIEEE Transactions on Circuits and Systems I: Regular Papers
Issue number9
Publication statusPublished - 01 Sep 2006

Bibliographical note

Copyright 2008 Elsevier B.V., All rights reserved.

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Hardware elliptic curve cryptographic processor over GF(p)'. Together they form a unique fingerprint.

Cite this