Lenstra's Algorithm: Integer Factorization

In course

Dolore laboris officia labore cupidatat occaecat cupidatat Lorem quis reprehenderit minim excepteur ullamco est. Laboris sint ullamco consequat ullamco velit fugiat fugiat ut duis cillum reprehenderit. Proident ut id mollit commodo dolore ea. Ut non cillum dolor id eiusmod anim anim tempor consectetur fugiat mollit veniam Lorem magna. Qui incididunt nulla cillum magna. Irure aliqua occaecat velit nisi est aliqua ex.

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

deserunt ea voluptate reprehenderit

Do dolore exercitation sunt id officia aliqua eu. Mollit in culpa cupidatat ea labore exercitation. Enim est mollit nulla cupidatat nostrud.

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)