Algorithms for Multi-exponentiation

By Bodo Möller. 2001

169 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Geometry and Topology, Information Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Jonathan Bootle
2. Darrel Hankerson
3. Alfred J. Menezes
4. Andrea Cerulli
5. Scott A. Vanstone
6. Pyrros Chaidos
7. Christophe Petit
8. Andrew V. Sutherland

In Geometry and Topology

1. Scott A. Vanstone
2. Alfred J. Menezes
3. Andrew V. Sutherland
4. Darrel Hankerson
5. Jonathan Bootle
6. Pyrros Chaidos
7. Christophe Petit
8. Jens Groth

In Information Systems

1. Darrel Hankerson
2. Alfred J. Menezes
3. Jonathan Bootle
4. Scott A. Vanstone
5. Andrea Cerulli
6. Andrew V. Sutherland
7. Pyrros Chaidos
8. Christophe Petit

Citations in the corpus

• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting (2016, methodology): “A multi-exponentiation of size n can be computed at a cost of roughly n logn single group exponentiations using the multiexponentiation techniques of [28, 31, 32].”
• Guide to Elliptic Curve Cryptography (2004, background): “51) is due to Gallant, Lambert, and Vanstone [160] and Möller [326].”
• Order computations in generic groups (2007, methodology): “The multi-exponentiation algorithm below is based on the transpose (dual) of an algorithm originally due to Straus [104] for computing a monomial α1 1 · · ·α ek k of multiple group elements (see also [76] or [73, Algorithm 14.”