On multi-exponentiation in cryptography.

Roberto Maria Avanzi · 2002

We describe and analyze new combinations of multi-exponentiation algorithms with representations of the exponents. We deal mainly but not exclusively with 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.

Read the paper · More papers on PaperTik