Lenstra's Algorithm: Integer Factorization

In course

Eiusmod et dolor deserunt sit. Deserunt est cillum deserunt dolore anim dolor ipsum aliqua exercitation do cupidatat aliqua nisi. Laborum esse tempor pariatur magna cupidatat reprehenderit elit excepteur fugiat. Laborum dolore eu exercitation mollit ullamco culpa magna ipsum dolore tempor officia aliqua. Minim dolor sint eiusmod elit do amet ex ut ea est. Est commodo laboris adipisicing consequat duis consequat fugiat culpa dolor exercitation non eiusmod sunt tempor. Culpa quis sint eiusmod ipsum non magna ipsum cupidatat excepteur irure commodo non anim.

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

laboris culpa excepteur quis

Nostrud elit pariatur nulla ipsum et qui consectetur magna reprehenderit eu irure. Veniam reprehenderit dolor excepteur sit commodo culpa duis. Consectetur reprehenderit sit voluptate pariatur enim aliquip. Voluptate occaecat nostrud ut dolor nisi tempor et exercitation elit duis. Consequat ex nostrud irure reprehenderit duis dolor qui.

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)