TY  - JOUR
  - Daly A., Marnane W. P., Kerins T., Popovici E.M.
  - 2004
  - August
  - Microprocessors and Microsystems
  - An FPGA Implementation of GF(p) ALU for Encryption Processors
  - Published
  - ()
  - GF(p) Elliptic curve cryptosystems Elliptic curve; Cryptography Arithmetic
  - 28
  - 5-6
  - 253
  - 260
  - 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.
  - 0141-9331
  - 10.1016/j.micpro.2004.03.006
  - Enterprise Ireland
DA  - 2004/08
ER  - 

@article{V344450,
   = {Daly A.,  Marnane W. P. and  Kerins T.,  Popovici E.M. },
   = {2004},
   = {August},
   = {Microprocessors and Microsystems},
   = {An FPGA Implementation of GF(p) ALU for Encryption Processors},
   = {Published},
   = {()},
   = {GF(p) Elliptic curve cryptosystems Elliptic curve; Cryptography Arithmetic},
   = {28},
   = {5-6},
  pages = {253--260},
   = {{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.}},
  issn = {0141-9331},
   = {10.1016/j.micpro.2004.03.006},
   = {Enterprise Ireland},
  source = {IRIS}
}