Rethinking Modular Multi-Exponentiation in Real-World Applications

Vidal Attias; Luigi Vigneri; Vassil Dimitrov

Paper 2021/1394

Rethinking Modular Multi-Exponentiation in Real-World Applications

Vidal Attias, Luigi Vigneri, and Vassil Dimitrov

Abstract

The importance of efficient multi-exponen- tiation algorithms in a large spectrum of cryptographic applications continues to grow. Many of the algorithms proposed in the past pay attention exclusively on the minimization of the number of modular multiplications. However, a short reduction of the multiplicative com- plexity can be easily overshadowed by other figures of merit. In this article we demonstrate a large number of practical results aimed at concrete cryptographic tasks requiring multi-exponentiations and provide rec- ommendations on the best possible algorithmic strate- gies for different selection of security parameters.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint. MINOR revision.
Contact author(s): vidal attias @ gmail com
History: 2021-10-15: received
Short URL: https://ia.cr/2021/1394
License: CC BY

BibTeX

@misc{cryptoeprint:2021/1394,
      author = {Vidal Attias and Luigi Vigneri and Vassil Dimitrov},
      title = {Rethinking Modular Multi-Exponentiation in Real-World Applications},
      howpublished = {Cryptology ePrint Archive, Paper 2021/1394},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/1394}},
      url = {https://eprint.iacr.org/2021/1394}
}