See this document in CiteSeerX!

Analysis of Some Efficient Window Methods and their Application to Elliptic Curve Cryptosystems (2004)  (Make Corrections)  
Katja Schmidt-Samoa, Olivier Semay, Tsuyoshi Takagi



  Home/Search   Context   Related

 
View or download:
informatik.tudarm...03.realfinal.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  informatik.tudar...2004_citeseer (more)
(Enter author homepages)

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

Abstract: Elliptic curve cryptosystems (ECC) are suitable for smart cards due to their small key-size. We have to make an effort to reduce both computation time and memory usage on such memory-constraint devices. A standard way to achieve this goal are window methods, which can enhance the speed of the scalar multiplication with a reasonable memory usage. The most famous ones are sliding window on NAF (NAF+SW), wNAF, and wMOF. A common drawback of these methods... (Update)

Active bibliography (related documents):   More   All
0.5:   Some Explicit Formulae of NAF and its Left-to-Right Analogue.. - Tetsuya Izu And (2005)   (Correct)
0.2:   Sannolikhetsteori På Tvåvåningsgrafer - Häggström   (Correct)
0.2:   Mathematical Models: Stochastic Models - Ferrari   (Correct)

Similar documents based on text:   More   All
0.2:   Signed Binary Representations Revisited - Okeya, Schmidt-Samoa, Spahn.. (2004)   (Correct)
0.2:   A Point Halving Algorithm for Hyperelliptic Curves - Kitamura, Katagi, Takagi (2004)   (Correct)
0.2:   A New Distributed Primality Test for Shared RSA Keys using.. - Biehl, Takagi (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ schmidt-samoa-analysis,
  author = "Katja Schmidt-Samoa and Olivier Semay and Tsuyoshi Takagi",
  title = "Analysis of Some Efficient Window Methods and their Application to Elliptic
    Curve Cryptosystems",
  url = "citeseer.ist.psu.edu/schmidt-samoa04analysis.html" }
Citations (may not include all citations):
1065   Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1996
216   Volume 2: Seminumerical Algorithms (context) - Knuth, of - 1981
119   Elliptic Curves in Cryptography - Blake, Seroussi et al. - 1999
101   A survey of fast exponentiation methods - Gordon - 1998
73   Speeding up the computations on an elliptic curve using addi.. - Morain, Olivos - 1990
45   Binary arithmetic (context) - Reitwiesner - 1960
34   the performance of signature schemes based on elliptic curve.. - de Win, Mister et al. - 1998
17   Ecient elliptic curve exponentiation using mixed coordinates (context) - Cohen, Miyaji et al. - 1998
5   Finite Markov Chains and Algorithmic Applications (context) - aggstr - 2002
2   Signed binary representations revisited - Okeya, Schmidt-Samoa et al. - 2004
1   13 A Previously Known Algorithms for Scalar Multiplication (context) - Solinas, on et al. - 2000
1   the Advanced Research on Ellipitic and Hyperelliptic Curve C.. (context) - Avanzi, in et al. - 2002
1   Improved techniques for fast exponentiation (context) - oller - 2003

Documents on the same site (http://www.informatik.tu-darmstadt.de/TI/Veroeffentlichung/reports/2004_citeseer.html):   More
On the Importance of Protecting Δ in SFLASH.. - Okeya, Takagi, Vuillaume   (Correct)
Towards a Flexible Intra-Trustcenter Management Protocol - Karatsiolis, Lippert.. (2004)   (Correct)
Interoperable and Flexible Digital Signatures for.. - Baier, Ruppert (2004)   (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