Lecture

Exponentiation: Time Complexity

Description

This lecture explains the fast exponentiation algorithm for calculating AB, where B is decomposed in binary form and the calculation involves squaring A multiple times followed by multiplication. The time complexity is O(n³) for AB (mod N) if N has n digits. The recursive version of the algorithm is discussed, along with the properties of prime numbers and the El-Gamal encryption scheme.

Official source

https://mediaspace.epfl.ch/media/0_1fwxeiiz

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.

Ontological neighbourhood

Mathematics

Number theory: Topics in number theory

Arithmetic: Topics in arithmetic

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (36)

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.