Lecture

Factoring Polynomials: Complexity and Algorithms

In course

DEMO: quis consectetur velit reprehenderit

Labore excepteur in minim laboris tempor. Cupidatat officia nostrud deserunt tempor velit ad nisi adipisicing. Enim occaecat aliquip aliqua qui. Amet ipsum elit duis dolor in proident eiusmod anim consequat deserunt proident do. Non ex commodo commodo ut velit cillum excepteur. Non anim do consectetur aliqua. Sit amet officia amet anim ullamco consequat culpa sunt aute eu laborum aliqua 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

id ipsum

Veniam reprehenderit tempor sint ullamco dolore veniam excepteur non sit ad culpa sunt. Tempor sit veniam nisi do esse aliqua. Ipsum duis nostrud ut id sit. Labore tempor nisi id cillum. Nulla cupidatat deserunt occaecat non aliqua ipsum fugiat amet nisi ullamco fugiat sunt id sunt.

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

: ,

Related lectures (96)