A generalized successive resultants algorithm

DOI10.1007/978-3-319-55227-9_9MaRDI QIDQ5267797zbMATH OpenOpenAlexFDO

Authors Benjamin Pring, James H. Davenport, Christophe Petit

Publication date 13 June 2017

Published in Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-55227-9_9

zbMATH Keywords

algorithmselliptic curvesfinite fieldsroot finding

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic theory of polynomial rings over finite fields (11T55) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm
• Deterministic root finding in finite fields
• Deterministic root finding over finite fields using Graeffe transforms
• Subgroup Refinement Algorithms for Root Finding in $GF(q)$
• Taking roots over high extensions of finite fields

Cites work

• scientific article; zbMATH DE number 5296403 (Why is no real title available?)
• scientific article; zbMATH DE number 3973040 (Why is no real title available?)
• scientific article; zbMATH DE number 799779 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Algebraic approaches for the elliptic curve discrete logarithm problem over prime fields
• Deterministic polynomial factoring and association schemes
• Deterministic root finding over finite fields using Graeffe transforms
• Elliptic curves. Number theory and cryptography
• Factoring Polynomials Over Large Finite Fields
• Factoring polynomials over finite fields: A survey
• Fast polynomial factorization and modular composition
• Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm
• Galois Groups and Factoring Polynomials over Finite Fields
• How to Hash into Elliptic Curves
• Modern computer algebra
• On the deterministic complexity of factoring polynomials
• On the deterministic complexity of factoring polynomials over finite fields
• Randomized root finding over finite FFT-fields using tangent Graeffe transforms
• Smoothness and factoring polynomials over finite fields

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: A generalized successive resultants algorithm

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