See this document in CiteSeerX!

Fast and Secure Elliptic Curve Scalar Multiplication over Prime Fields Using Special Addition Chains (2006)  (Make Corrections)  
Nicolas Meloni



  Home/Search   Context   Related

 
View or download:
iacr.org/2006/216.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  iacr.org/2006/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we propose a new fast and secure point multiplication algorithm. It is based on a particular kind of addition chains involving only additions (no doubling), providing a natural protection against side channel attacks. Moreover, we propose new addition formulae that take into account the specific structure of those chains making point multiplication very e#cient. (Update)

Active bibliography (related documents):   More   All
0.5:   Efficient Divisor Class Halving on Genus Two Curves - Birkner (2006)   (Correct)
0.3:   An Improved and Efficient Countermeasure against Power .. - Kim, Ha, Moon, Yen.. (2005)   (Correct)
0.3:   Fast Elliptic Curve Point Multiplication using Double-Base.. - Dimitrov, Imbert, Mishra (2005)   (Correct)

Similar documents based on text:
6.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ meloni-fast,
  author = "Nicolas Meloni",
  title = "Fast and Secure Elliptic Curve Scalar Multiplication over Prime Fields
    Using Special Addition Chains",
  url = "citeseer.ist.psu.edu/meloni06fast.html" }
Citations (may not include all citations):
2003   The Art of Computer Programming (context) - Knuth - 1981
2003   The Art of Computer Programming (context) - Knuth - 1981
257   Elliptic curve cryptosystems (context) - Koblitz - 1987
228   Uses of elliptic curves in cryptography (context) - Miller - 1986
161   Timing attacks on implementations of Di#e-Hellman (context) - Kocher - 1996
145   erential power analysis (context) - Kocher, Ja et al. - 1999
65   Speeding the Pollard and elliptic curve methods of factoriza.. (context) - Montgomery - 1987
36   Hessian elliptic curves and sidechannel attacks - Joye, Quisquater - 2001
17   Analysis of the subtractive algorithm for greatest common di.. (context) - Knuth, Yao - 1975
13   Guide to Elliptic Curve Cryptography (context) - Hankerson, Menezes et al. - 2004
4   cient Elliptic curve cryptosystems from a scalar multiplicat.. (context) - Okeya, Sakurai - 2001
4   cient and secure Elliptic Curve Point Multiplication Using D.. (context) - Dimitrov, Imbert et al. - 2005
3   Low-cost solutions for preventing simple side-channel analys.. - Chevalier-Mames, Ciet et al. - 2004
2   Handbook of Elliptic and Hyperelliptic Curve Cryptography (context) - Avanzi, Cohen et al. - 2005

Documents on the same site (http://eprint.iacr.org/2006/):   More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006)   (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006)   (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC