An FPGA implementation of a GF(p) ALU for encryption processors

Research output: Contribution to journalArticlepeer-review

Abstract

Secure electronic and internet transactions require public key cryptosystems to establish and distribute shared secret information for use in the bulk encryption of data. For security reasons, key sizes are in the region of hundred's of bits. This makes cryptographic procedures slow in software. Hardware accelerators can perform the computationally intensive operations far quicker. Field-Programmable Gate Arrays are well-suited for this application due to their reconfigurability and versatility. Elliptic Curve Cryptosystems over GF(p) have received very little attention to date due to the seemingly more attractive finite field GF(2m). However, we present a GF(p) Arithmetic Logic Unit which can perform 160-bit arithmetic at clock speeds of up to 50 MHz.

Original languageEnglish
Pages (from-to)253-260
Number of pages8
JournalMicroprocessors and Microsystems
Volume28
Issue number5-6 SPEC. ISS.
DOIs
Publication statusPublished - 2 Aug 2004

Keywords

  • Arithmetic
  • Cryptography
  • Elliptic curve
  • Elliptic curve cryptosystems
  • GF(p)

Fingerprint

Dive into the research topics of 'An FPGA implementation of a GF(p) ALU for encryption processors'. Together they form a unique fingerprint.

Cite this