Subgroup Refinement Algorithms for Root Finding in GF(q)

DOI10.1137/0221018MaRDI QIDQ3990651zbMATH OpenOpenAlexFDO

Authors Scott A. Vanstone, Alfred Menezes, P. C. Van Oorschot

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

zbMATH Keywords

deterministic algorithmfinite fieldspolynomial timepolynomial factorizationroot finding algorithm

Mathematics Subject Classification ID

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

Recommendations

• Deterministic root finding in finite fields
• A geometric approach to root finding in GT(q/sup m/)
• Deterministic root finding over finite fields using Graeffe transforms
• Efficient computation of roots in finite fields
• Taking roots over high extensions of finite fields

Cited in

(10)

• Character sums and deterministic polynomial root finding in finite fields
• Deterministic root finding in finite fields
• Computing Frobenius maps and factoring polynomials
• Deterministic root finding over finite fields using Graeffe transforms
• A geometric approach to root finding in GT(q/sup m/)
• Guest editorial: Special issue in honor of Scott A. Vanstone
• Trace-orthogonal normal bases
• Factoring polynomials over finite fields: A survey
• A generalized successive resultants algorithm
• Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm

This page was built for publication: Subgroup Refinement Algorithms for Root Finding in $GF(q)$

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