scientific article; zbMATH DE number 1273636

zbMATH Open0955.11500MaRDI QIDQ4237366FDOQ4237366

Victor Shoup

Publication date: 14 March 2000

Title of this publication is not available (Why is that?)

zbMATH Keywords

algorithmfinite fieldspolynomial factorization

Mathematics Subject Classification ID

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

Cited In (21)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Modular composition modulo triangular sets and applications
• Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
• Deterministic root finding in finite fields
• Computing Frobenius maps and factoring polynomials
• A new efficient factorization algorithm for polynomials over small finite fields
• Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
• Deterministic root finding over finite fields using Graeffe transforms
• Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2
• Univariate polynomial factorization over finite fields
• Bivariate polynomial reduction and elimination ideal over finite fields
• On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic
• Factoring polynomials over arbitrary finite fields
• A babystep-giantstep method for faster deterministic integer factorization
• Subquadratic-time factoring of polynomials over finite fields
• Elimination ideal and bivariate resultant over finite fields
• Title not available (Why is that?)
• A subquadratic algorithm for computing the $n$-th Bernoulli number
• On Bivariate Polynomial Factorization over Finite Fields
• Threshold data structures and coding theory

   Recommendations

• A new efficient factorization algorithm for polynomials over small finite fields 👍 👎
• Title not available (Why is that?) 👍 👎
• A New Algorithm for Factoring Polynomials Over Finite Fields 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A fast algorithm for polynomial factorization over \(\mathbb Q_p\) 👍 👎
• On the deterministic complexity of factoring polynomials over finite fields 👍 👎
• An efficient algorithm for factoring polynomials over algebraic extension field 👍 👎
• Deterministic distinct-degree factorization of polynomials over finite fields 👍 👎
• On a New Factorization Algorithm for Polynomials Over Finite Fields 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4237366)