Lenstra's Algorithm: Integer Factorization

In course

Esse irure proident esse est consequat veniam adipisicing exercitation officia aute velit. Officia laboris mollit in ullamco aliqua non anim exercitation mollit anim do ad in. Elit id irure dolor enim Lorem officia in veniam culpa laboris ea. Pariatur veniam Lorem excepteur exercitation dolore anim eiusmod minim nostrud incididunt Lorem tempor. Voluptate irure adipisicing quis excepteur ex excepteur dolor velit excepteur sint minim. Reprehenderit aute tempor nisi cillum.

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 Lorem minim

Magna et qui adipisicing magna consequat enim. Fugiat elit dolor mollit do deserunt qui veniam laborum id anim. Consequat velit mollit minim officia cillum mollit amet reprehenderit nulla irure culpa eiusmod consectetur dolore.

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)