The complexity of certain multi-eTechniques in cryptography

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)357-373
Number of pages17
JournalJournal of Cryptology
Issue number4
StatePublished - Sep 2005
Externally publishedYes


  • Elliptic and hyperelliptic curves
  • Exponentiation
  • Groups with automorphisms
  • Integer recoding
  • Scalar multiplication
  • Trace zero varieties
  • XTR

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Applied Mathematics


Dive into the research topics of 'The complexity of certain multi-eTechniques in cryptography'. Together they form a unique fingerprint.

Cite this