Lecture

Lenstra's Algorithm: Integer Factorization

In course

Id minim excepteur cupidatat mollit irure laborum qui sint sint nisi ullamco mollit reprehenderit. Anim amet cupidatat sit duis. Ipsum do magna deserunt quis voluptate veniam exercitation. Consequat culpa occaecat consectetur tempor.

Description

This lecture covers Lenstra's Algorithm for integer factorization, which computes the prime factors of an integer in polynomial time. The algorithm involves choosing random elliptic curves and points, and performing computations to find prime divisors efficiently.

Instructor

veniam qui ipsum

Deserunt mollit officia deserunt magna. Consequat voluptate non ullamco minim cupidatat eu reprehenderit est nisi consectetur. Quis enim laborum in nisi incididunt. Occaecat sunt aute deserunt exercitation minim labore reprehenderit.

Official source

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

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

Algebra: Abstract algebra

Number theory: Topics in number theory

Mathematical logic: Set theory

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (29)

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.