Sciweavers

49 search results - page 6 / 10
» Pipelined Computation of Scalar Multiplication in Elliptic C...
Sort
View
SACRYPT
2005
Springer
14 years 25 days ago
SPA Resistant Left-to-Right Integer Recodings
We present two left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a s...
Nicolas Thériault
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 ...
DCC
2006
IEEE
14 years 7 months ago
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. ...
ESORICS
2011
Springer
12 years 7 months ago
Remote Timing Attacks Are Still Practical
For over two decades, timing attacks have been an active area of research within applied cryptography. These attacks exploit cryptosystem or protocol implementations that do not ru...
Billy Bob Brumley, Nicola Tuveri
IACR
2011
120views more  IACR 2011»
12 years 7 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
David Jao, Luca De Feo