See this document in CiteSeerX!

Algorithms for Multi-Exponentiation (2001)  (Make Corrections)  
Bodo Möller



  Home/Search   Context   Related

 
View or download:
informatik.tudarm...0108.multiexp.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  informatik.tud...DME.year.author (more)
(Enter author homepages)

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

Abstract: This paper compares di#erent approaches for computing power products i in finite groups. We look at the conventional simultaneous exponentiation approach and present an alternative strategy, interleaving exponentiation. Our comparison shows that in general groups, sometimes the conventional method and sometimes interleaving exponentiation is more e#cient. In groups where inverting elements is easy (e.g. elliptic curves), interleaving exponentiation with signed exponent recoding... (Update)

Active bibliography (related documents):   More   All
2.1:   Algorithms for Multi-Exponentiation - Möller (2001)   (Correct)
0.3:   Platform Independent Elliptic Curve Cryptography over F_p - Henhapl (2002)   (Correct)
0.3:   A Survey of Public-Key Cryptosystems - Koblitz, Menezes   (Correct)

Similar documents based on text:   More   All
0.5:   Provably Secure Public-Key Encryption for Length-Preserving.. - Möller (2002)   (Correct)
0.3:   Enhancing Classroom Lectures with Digital Sliding.. - Rößling, Trompler.. (2004)   (Correct)
0.2:   Security of Cryptosystems Based on Class Groups of Imaginary.. - Hamdy, Möller (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ ller-algorithms,
  author = "Bodo Möller",
  title = "Algorithms for Multi-Exponentiation",
  url = "citeseer.ist.psu.edu/717190.html" }
Citations (may not include all citations):
1065   Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1997
601   A public-key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985
161   Timing attacks on implementations of Di#e-Hellman (context) - Kocher - 1996
145   erential power analysis (context) - Kocher, Jaffe et al. - 1999
143   Digital Signature Standard (context) - of, Technology - 2000
71   Rethinking Public Key Infrastructures and Digital Certificat.. (context) - Brands - 2000
36   More flexible exponentiation with precomputation - Lim, Lee - 1994
34   cient elliptic curve exponentiation using mixed coordinates (context) - Cohen, Ono et al. - 1998
25   Public key cryptography for the financial services industry:.. (context) - Standards, ANSI - 1998
24   Addition chain heuristics (context) - Bos, Coster - 1989
14   Software implementation of the NIST elliptic curves over pri.. - Brown, Hankerson et al. - 2020
14   cient elliptic curve exponentiation (context) - Miyaji, Ono et al. - 1997
12   cient arithmetic on Koblitz curves (context) - Solinas - 2000
8   A signature scheme based on the intractability of extracting.. (context) - Biehl, Buchmann et al.
4   A survey on IQ cryptography - Buchmann, Hamdy - 2000
3   Problems and solutions: Addition chains of vectors (context) - Straus - 1964
2   IEEE Transactions on Computers (context) - Dimitrov, Jullien et al. - 2000
2   IEE Proceedings -- Computers and Digital Techiques (context) - Yen, Laih et al. - 1994

Documents on the same site (http://www.informatik.tu-darmstadt.de/TI/Veroeffentlichung/reports/README.year.author.html):   More
On the Security of a Modified Paillier Public-Key Primitive - Sakurai, Takagi (2002)   (Correct)
On Some Computational Problems in Finite Abelian Groups - Buchmann, Jacobson, Jr..   (Correct)
Efficient Undeniable Signature Schemes Based on Ideal.. - Biehl, Paulus, Takagi (1999)   (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