Sciweavers

32 search results - page 3 / 7
» Faster Addition and Doubling on Elliptic Curves
Sort
View
CHES
2008
Springer
151views Cryptology» more  CHES 2008»
13 years 9 months ago
Binary Edwards Curves
Abstract. This paper presents a new shape for ordinary elliptic curves over fields of characteristic 2. Using the new shape, this paper presents the first complete addition formula...
Daniel J. Bernstein, Tanja Lange, Reza Rezaeian Fa...
ITNG
2007
IEEE
14 years 1 months ago
SPA resistant Elliptic Curve Cryptosystem using Addition Chains
: There has been a lot of interest in recent years in the problems faced by cryptosystems due to side channel attacks. Algorithms for elliptic curve point scalar multiplication suc...
Andrew Byrne, Nicolas Meloni, Francis M. Crowe, Wi...
TC
2011
13 years 1 months ago
Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
Jithra Adikari, Vassil S. Dimitrov, Laurent Imbert
AAECC
2003
Springer
116views Algorithms» more  AAECC 2003»
14 years 17 days ago
The Jacobi Model of an Elliptic Curve and Side-Channel Analysis
Abstract. A way for preventing SPA-like attacks on elliptic curve systems is to use the same formula for the doubling and the general addition of points on the curve. Various propo...
Olivier Billet, Marc Joye
ARC
2009
Springer
142views Hardware» more  ARC 2009»
14 years 2 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...