A Simple Architectural Enhancement for Fast and Flexible Elliptic Curve Cryptography over Binary Finite Fields GF(2 m )

S Tillich, J Großschädl - Advances in Computer Systems Architecture: 9th …, 2004 - Springer
Mobile and wireless devices like cell phones and network-enhanced PDAs have become
increasingly popular in recent years. The security of data transmitted via these devices is a …

Efficient Hardware Implementation of Elliptic Curve Cryptography over GF(p m )

MK Lee, KT Kim, H Kim, DK Kim - … , WISA 2005, Jeju Island, Korea, August …, 2006 - Springer
Elliptic curve cryptography (ECC) was discovered by Koblitz and Miller, and there has been
a vast amount of research on its secure and efficient implementation. To implement ECC …

Efficient multiplication in GF (p/sup k/) for elliptic curve cryptography

JC Bajard, L Imbert, C Negre… - Proceedings 2003 16th …, 2003 - ieeexplore.ieee.org
We present a new multiplication algorithm for the implementation of elliptic curve
cryptography (ECC) over the finite extension fields GF (p/sup k/) where p is a prime number …

Instruction set extension for fast elliptic curve cryptography over binary finite fields GF (2/sup m/)

J Groszschaedl, GA Kamendje - Proceedings IEEE International …, 2003 - ieeexplore.ieee.org
The performance of elliptic curve (EC) cryptosystems depends essentially on efficient
arithmetic in the underlying finite field. Binary finite fields GF (2/sup m/) have the advantage …

Generic implementations of elliptic curve cryptography using partial reduction

N Gura, H Eberle, SC Shantz - Proceedings of the 9th ACM conference …, 2002 - dl.acm.org
Elliptic Curve Cryptography (ECC) is evolving as an attractive alternative to other public-key
schemes such as RSA by offering the smallest key size and the highest strength per bit. The …

A systolic architecture for elliptic curve cryptosystems

WC Tsai, SJ Wang - WCC 2000-ICSP 2000. 2000 5th …, 2000 - ieeexplore.ieee.org
This article presents a new systolic architecture for the main operation in an elliptic curve
cryptosystem over the finite field GF (2/sup m/). This proposed architecture is actually a finite …

Architectural extensions for elliptic curve cryptography over gf (2/sup m/) on 8-bit microprocessors

H Eberle, A Wander, N Gura… - 2005 IEEE …, 2005 - ieeexplore.ieee.org
We describe and analyze architectural extensions to accelerate the public key cryptosystem
elliptic curve cryptography (ECC) on 8-bit microprocessors. We show that simple extensions …

A tightly coupled finite field arithmetic hardware in an FPGA-based embedded processor core for elliptic curve cryptography

M Khalil-Hani, A Irwansyah… - International Journal of …, 2009 - inderscienceonline.com
This work presents the implementation of a tightly-coupled hardware architectural
enhancement to the Altera FPGA-based Nios II embedded processor. The goal is to …

Generic GF(2m) Arithmetic in Software and Its Application to ECC

A Weimerskirch, D Stebila, SC Shantz - … , July 9–11, 2003 Proceedings 8, 2003 - Springer
This work discusses generic arithmetic for arbitrary binary fields in the context of elliptic
curve cryptography (ECC). ECC is an attractive public-key cryptosystem recently endorsed …

A compact FPGA-based architecture for elliptic curve cryptography over prime fields

J Vliegen, N Mentens, J Genoe… - ASAP 2010-21st …, 2010 - ieeexplore.ieee.org
This paper proposes an FPGA-based application-specific elliptic curve processor over a
prime field. This research targets applications for which compactness is more important than …