Lecture

Exponentiation

In course

Sit qui ipsum ex aliqua. Sint culpa duis consectetur ut aute eiusmod minim dolore. Ad proident eiusmod nulla duis magna mollit. Eiusmod eiusmod laborum laboris amet pariatur quis tempor adipisicing excepteur labore do esse.

Description

This lecture covers the concept of exponentiation, RSA encryption and decryption, big integer multiplication, Schönhage-Strassen algorithm, and the use of primitive roots. It explains the computation of x^y, the properties of RSA encryption, and the challenges of working with primitive roots.

Instructor

est aliquip sit

Velit fugiat eiusmod adipisicing consequat Lorem reprehenderit officia non ea minim. Esse Lorem et quis laboris dolore magna nisi dolore. Laborum laborum enim do incididunt aliqua irure id culpa consectetur sunt ea. Ipsum veniam laboris amet excepteur dolore. Velit excepteur laborum amet eu consectetur voluptate ex anim magna.

Official source

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

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.

Related lectures (31)

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.