Subgroup Refinement Algorithms for Root Finding in $GF(q)$
From MaRDI portal
Publication:3990651
DOI10.1137/0221018zbMath0754.11041OpenAlexW1988473257MaRDI QIDQ3990651
Scott A. Vanstone, Paul C. van Oorschot, Alfred J. Menezes
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221018
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Factorization (11Y05)
Related Items (7)
Computing Frobenius maps and factoring polynomials ⋮ Deterministic root finding over finite fields using Graeffe transforms ⋮ Guest editorial: Special issue in honor of Scott A. Vanstone ⋮ Factoring polynomials over finite fields: A survey ⋮ Trace-orthogonal normal bases ⋮ Deterministic root finding in finite fields ⋮ Finding roots in with the successive resultants algorithm
This page was built for publication: Subgroup Refinement Algorithms for Root Finding in $GF(q)$