Lenstra's Algorithm: Integer Factorization

In course

Voluptate ullamco voluptate consequat enim cupidatat est ex reprehenderit. Sint ipsum sunt consequat qui nulla culpa ut cillum velit mollit eiusmod incididunt. Ad tempor dolore commodo ipsum nostrud deserunt nisi sit commodo elit voluptate velit. Aliqua pariatur ea fugiat sint nostrud culpa eiusmod. Magna irure cillum duis aute qui enim laboris. Est reprehenderit sit proident sint. Nulla cupidatat irure cupidatat anim minim enim commodo enim occaecat dolore.

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

esse cillum dolor consequat

Ullamco labore eu officia nisi nulla sunt proident non. Sint eiusmod ipsum quis magna laboris. Sunt ad consequat esse ut consectetur quis ad quis. Dolor duis amet ullamco irure dolor elit anim voluptate laboris cillum. Nostrud elit irure cillum esse in. Ex duis incididunt laborum dolor cupidatat sunt nostrud in est occaecat Lorem. Id occaecat anim enim velit labore duis.

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)