Multi-exponentiation
Yen, S.-M.; Laih, C.-S.; Lenstra, Arjen K.
1994

Files

Abstract

In several cryptographic protocols the product of a small number of exponentiations is required, but the separate exponentiation results are not needed. A simultaneous exponentiation algorithm that takes advantage of this situation and that is substantially faster than the ordinary approach using separate exponentiations is presented.

Details

Title Multi-exponentiation
Author(s) Yen, S.-M. ; Laih, C.-S. ; Lenstra, Arjen K.
Published in IEE Proceedings: Computers and Digital Techniques
Volume 141
Issue 6
Pages 325-326
Date 1994
ISSN 13502387
Keywords
DOI https://doi.org/10.1049/ip-cdt:19941271
Laboratories LACAL
Record Appears in Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LACAL - Laboratory for cryptologic algorithms
Peer-reviewed publications
Work outside EPFL
Journal Articles
Published
Record creation date 2010-06-25

Actions

Preview