Sciweavers

36 search results - page 2 / 8
» An FPGA Implementation of an Elliptic Curve Cryptosystem Cop...
Sort
View
CHES
2010
Springer
183views Cryptology» more  CHES 2010»
13 years 5 months ago
Coordinate Blinding over Large Prime Fields
In this paper we propose a multiplicative blinding scheme for protecting implementations of a scalar multiplication over elliptic curves. Specifically, this blinding method applies...
Michael Tunstall, Marc Joye
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
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
RECONFIG
2008
IEEE
184views VLSI» more  RECONFIG 2008»
13 years 11 months ago
FPGA Implementation of an Elliptic Curve Cryptosystem over GF(3^m)
This paper describes an efficient arithmetic processor for elliptic curve cryptography. The proposed processor consists of special architectural components, the most important of...
Ilker Yavuz, Siddika Berna Ors Yalcin, Çeti...
ASIACRYPT
1999
Springer
13 years 9 months ago
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jian...