Algorithms for Multi-exponentiation

@inproceedings{Mller2001AlgorithmsFM,
  title={Algorithms for Multi-exponentiation},
  author={Bodo M{\"o}ller},
  booktitle={Selected Areas in Cryptography},
  year={2001}
}
This paper compares different approaches for computing power products ∏ 1≤i≤k g ei i in commutative 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 efficient. In groups where inverting elements is easy (e.g. elliptic curves), interleaving exponentiation with signed exponent… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 87 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 20 references

A survey on IQ cryptogra

  • J. Buchmann, S. Hamdy
  • Progress in Cryptology – CT - RSA
  • 2001

A survey on IQ cryptography

  • J. Buchmann, S. Hamdy
  • In Proceedings of Public Key Cryptography and…
  • 2000
1 Excerpt

Rethinking Public Key Infrastructures and Digital Certificates – Building in Privacy

  • S. Brands
  • 2000
1 Excerpt

Public key cryptography for the financial services industry : The elliptic curve digital signature algorithm ( ECDSA )

  • I. Biehl, J. Buchmann, S. Hamdy, A. Meyer
  • 1998

Similar Papers

Loading similar papers…