Sciweavers

37 search results - page 2 / 8
» Fast Algorithms for Elliptic Curve Cryptosystems over Binary...
Sort
View
PKC
2000
Springer
95views Cryptology» more  PKC 2000»
13 years 9 months ago
Selecting Cryptographic Key Sizes
In this article we offer guidelines for the determination of key sizes for symmetric cryptosystems, RSA, and discrete logarithm based cryptosystems both over finite fields and over...
Arjen K. Lenstra, Eric R. Verheul
CANS
2006
Springer
129views Cryptology» more  CANS 2006»
13 years 9 months ago
Side Channel Attacks and Countermeasures on Pairing Based Cryptosystems over Binary Fields
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...
Tae-Hyun Kim, Tsuyoshi Takagi, Dong-Guk Han, Ho Wo...
ENC
2004
IEEE
13 years 9 months ago
On the Hardware Design of an Elliptic Curve Cryptosystem
We present a hardware architecture for an Elliptic Curve Cryptography System performing the three basic cryptographic schemes: DH key generation, encryption and digital signature....
Miguel Morales-Sandoval, Claudia Feregrino Uribe
DCC
2000
IEEE
13 years 5 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
MASCOTS
2001
13 years 6 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement