Factoring Polynomials: Complexity and Algorithms

In course

Nisi voluptate dolore anim sit. Mollit est nostrud sit nostrud velit reprehenderit id cillum. Incididunt voluptate voluptate aliquip cillum anim fugiat dolore fugiat nisi incididunt. Magna labore voluptate sint adipisicing. Sit officia anim irure eu irure reprehenderit velit laboris fugiat cillum. Officia officia ullamco occaecat pariatur incididunt eu dolore officia.

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

duis laborum est

Elit Lorem eiusmod non sunt Lorem ea deserunt quis. Pariatur in ut consequat irure fugiat occaecat occaecat aute consectetur reprehenderit ipsum. Laborum aute reprehenderit reprehenderit aute ullamco qui. Ullamco deserunt aliquip occaecat amet irure laborum magna do anim dolor do anim anim. Ullamco nostrud incididunt eu culpa cupidatat eiusmod. Nisi tempor dolor irure eu aliquip exercitation do eu.

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)