Events by date

Title: Probabilistic root finding in code-based cryptography

Speaker: Daniel Panario Affiliation: School of Mathematics and Statistics, Carleton University Location: MC 5501 or contact Eva Lee for Zoom link

Abstract: Factorization of polynomials over finite fields, and the particular subproblem of finding roots of polynomials, have many applications in diverse areas such as computer algebra, cryptography and coding theory, among many others. In practice, fast factorization algorithms are probabilistic.