Sciweavers

74 search results - page 6 / 15
» High-Performance Architecture of Elliptic Curve Scalar Multi...
Sort
View
CARDIS
2010
Springer
163views Hardware» more  CARDIS 2010»
14 years 2 months ago
Atomicity Improvement for Elliptic Curve Scalar Multiplication
Christophe Giraud, Vincent Verneuil
CHES
2008
Springer
134views Cryptology» more  CHES 2008»
13 years 9 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
MYCRYPT
2005
Springer
189views Cryptology» more  MYCRYPT 2005»
14 years 26 days ago
An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = kˆ i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤   c + o(1) ¡ log n log log n ....
Mathieu Ciet, Francesco Sica
PKC
1998
Springer
123views Cryptology» more  PKC 1998»
13 years 11 months ago
Two Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...
Jung Hee Cheon, Sung-Mo Park, Sangwoo Park, Daeho ...
PKC
2004
Springer
158views Cryptology» more  PKC 2004»
14 years 22 days ago
Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius Endomorphism
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
Roberto Maria Avanzi, Mathieu Ciet, Francesco Sica