Abstract
We describe, analyze and compare some combinations of multi-exponentiation algorithms with representations of the exponents. We are especially interested in the case where the inversion of group elements is fast: this is true for example for elliptic curves, groups of rational divisor classes of hyperelliptic curves, trace zero varieties and XTR. The methods can also be used for computing single exponentiations in groups which admit an appropriate automorphism satisfying a monic equation of small degree over the integers.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Avanzi, R. The Complexity of Certain Multi-Exponentiation Techniques in Cryptography. J Cryptology 18, 357–373 (2005). https://doi.org/10.1007/s00145-004-0229-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-004-0229-5