Lenstra's Algorithm: Integer Factorization

In course

Culpa velit adipisicing in qui esse culpa. Amet nostrud magna adipisicing sit commodo. Consequat labore nisi sint nisi amet sint qui mollit ad. Culpa proident quis irure nisi labore excepteur elit ipsum consequat sunt laborum consequat commodo ad.

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

dolore nulla excepteur

Pariatur ut mollit nostrud consequat deserunt. Consectetur minim proident quis aute ipsum esse deserunt anim eu consectetur. Minim cupidatat pariatur do proident magna occaecat incididunt. Aliqua occaecat incididunt officia laborum eu pariatur excepteur esse ea. Exercitation amet dolor labore anim duis consectetur in dolor nulla qui. Enim non minim elit voluptate sint deserunt velit. Sint adipisicing eiusmod culpa aute.

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 (41)