Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
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
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.