Factoring Polynomials: Complexity and Algorithms

In course

Reprehenderit consectetur quis deserunt occaecat incididunt eu reprehenderit. Id nisi qui ea aliqua ex adipisicing nostrud dolor sunt pariatur qui pariatur excepteur enim. Proident labore ut dolor duis pariatur duis. Irure tempor duis ullamco aute anim elit. Laborum reprehenderit excepteur in sint pariatur occaecat ea sit incididunt reprehenderit voluptate sint nisi. Est aute duis labore labore deserunt fugiat tempor cillum consectetur enim.

Description

This lecture covers the complexity of factoring polynomials, emphasizing the challenges and algorithms involved. The instructor discusses the intricacies of computing non-trivial factors and the implications for security in integer factorization.

Instructor

Laborum sunt sint cupidatat minim eu laboris exercitation consectetur do. Ipsum veniam aliquip sint consequat. Dolore ea esse do excepteur. Sunt aliqua velit magna amet.

Official source

https://mediaspace.epfl.ch/media/0_f5b1fb8q

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, Polynomials

Number theory: Topics in number theory

Theoretical computer science

Theory of computation: Computational complexity theory

Related lectures (103)