Sciweavers

36 search results - page 1 / 8
» An FPGA Implementation of an Elliptic Curve Cryptosystem Cop...
Sort
View
AAECC
2003
Springer
165views Algorithms» more  AAECC 2003»
13 years 6 months ago
Fast Point Multiplication on Elliptic Curves through Isogenies
Elliptic curve cryptosystems are usually implemented over fields of characteristic two or over (large) prime fields. For large prime fields, projective coordinates are more suitabl...
Eric Brier, Marc Joye
ARC
2009
Springer
142views Hardware» more  ARC 2009»
13 years 9 months ago
A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem
Abstract. This paper presents implementation results of a reconfigurable elliptic curve processor defined over prime fields GF(p). We use this processor to compare a new algorit...
Brian Baldwin, Richard Moloney, Andrew Byrne, Gary...
ICICS
1997
Springer
13 years 6 months ago
Efficient elliptic curve exponentiation
Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosys...
Atsuko Miyaji, Takatoshi Ono, Henri Cohen
CHES
2008
Springer
134views Cryptology» more  CHES 2008»
13 years 4 months ago
Ultra High Performance ECC over NIST Primes on Commercial FPGAs
Elliptic Curve Cryptosystems (ECC) have gained increasing acceptance in practice due to their significantly smaller bit size of the operands compared to other public-key cryptosyst...
Tim Güneysu, Christof Paar