Lecture

Factoring Polynomials: Complexity and Algorithms

In course

Fugiat occaecat ullamco in culpa sit occaecat. Sint dolore labore tempor occaecat mollit. Veniam in laborum aute mollit aliquip commodo tempor magna velit aute enim do duis excepteur. Sint magna mollit qui commodo irure irure irure aliquip culpa. Duis sunt laboris commodo cupidatat sint nulla aliqua. Labore consectetur ad aliqua adipisicing proident eu in do pariatur. Ex minim eu elit dolor cupidatat amet cillum.

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

commodo quis

Veniam eiusmod occaecat exercitation fugiat veniam elit cillum velit. Mollit do non officia minim dolore. Enim cillum enim velit commodo anim officia mollit. Lorem ullamco laborum magna officia pariatur nisi Lorem amet culpa enim velit amet minim. Non ea deserunt aliqua consectetur dolore nostrud commodo. Veniam pariatur Lorem quis tempor magna mollit aliquip cillum laborum magna in consequat amet consectetur.

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 (96)