Sciweavers

24 search results - page 2 / 5
» Hardware Implementation of Efficient Modified Karatsuba Mult...
Sort
View
CHES
2000
Springer
167views Cryptology» more  CHES 2000»
13 years 8 months ago
A High Performance Reconfigurable Elliptic Curve Processor for GF(2m)
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
Gerardo Orlando, Christof Paar
ICONS
2008
IEEE
13 years 10 months ago
An Efficient Hardware Implementation of the Tate Pairing in Characteristic Three
DL systems with bilinear structure recently became an important base for cryptographic protocols such as identity-based encryption (IBE). Since the main computational task is the ...
Giray Kömürcü, Erkay Savas
DATE
2007
IEEE
103views Hardware» more  DATE 2007»
13 years 10 months ago
Flexible hardware reduction for elliptic curve cryptography in GF(2m)
In this paper we discuss two ways to provide flexible hardware support for the reduction step in Elliptic Curve Cryptography in binary fields (GF(2m )). In our first approach w...
Steffen Peter, Peter Langendörfer, Krzysztof ...
ISCAS
2008
IEEE
154views Hardware» more  ISCAS 2008»
13 years 10 months ago
A 6.3nJ/op low energy 160-bit modulo-multiplier for elliptic curve cryptography processor
— A low energy modulo-multiplier is proposed for elliptic curve cryptography (ECC) processor, especially for authentication in mobile device or key encryption in embedded health-...
Hyejung Kim, Yongsang Kim, Hoi-Jun Yoo
DCC
2000
IEEE
13 years 3 months ago
Efficient Arithmetic on Koblitz Curves
It has become increasingly common to implement discrete-logarithm based public-key protocols on elliptic curves over finite fields. The basic operation is scalar multiplication: ta...
Jerome A. Solinas