Publication

Multi-exponentiation

Arjen Lenstra
1994
Journal paper

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.

Official source

https://infoscience.epfl.ch/record/149729?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Multi-exponentiation

Graph Chatbot

Chat with Graph Search

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers

Serial Lightweight Implementation Techniques for Block Ciphers

On the (Im)possibility of Commitment over Gaussian Unfair Noisy Channels

Complete Practical Side-Channel-Assisted Reverse Engineering of AES-Like Ciphers

Serial Lightweight Implementation Techniques for Block Ciphers