scientific article; zbMATH DE number 1253982

zbMath0920.11082MaRDI QIDQ4226960

Victor Shoup, Erich L. Kaltofen

Publication date: 10 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityalgorithmsfinite fieldfactoring polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items

On the Cipolla-Lehmer type algorithms in finite fields, On the complexity exponent of polynomial system solving, Genus 2 point counting over prime fields, Univariate polynomial factorization over finite fields with large extension degree, Fast algorithms for computing isogenies between ordinary elliptic curves in small characteristic, Computing isomorphisms and embeddings of finite fields, Fast rectangular matrix multiplication and some applications, Threshold data structures and coding theory, Subquadratic-time factoring of polynomials over finite fields, Computing in degree \(2^k\)-extensions of finite fields of odd characteristic, Modular composition via factorization, Fast multivariate multi-point evaluation revisited, Taking roots over high extensions of finite fields