A Generalised Successive Resultants Algorithm
DOI10.1007/978-3-319-55227-9_9zbMATH Open1409.11134OpenAlexW2592460274MaRDI QIDQ5267797FDOQ5267797
Christophe Petit, Benjamin Pring, James H. Davenport
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
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)
Cites Work
- Fast Polynomial Factorization and Modular Composition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Factoring Polynomials Over Large Finite Fields
- On the deterministic complexity of factoring polynomials over finite fields
- Modern computer algebra
- Smoothness and factoring polynomials over finite fields
- Randomized root finding over finite FFT-fields using tangent Graeffe transforms
- Deterministic root finding over finite fields using Graeffe transforms
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Galois Groups and Factoring Polynomials over Finite Fields
- Title not available (Why is that?)
- Deterministic polynomial factoring and association schemes
- Factoring polynomials over finite fields: A survey
- On the deterministic complexity of factoring polynomials
- Title not available (Why is that?)
- How to Hash into Elliptic Curves
- Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
- Finding roots in \(\mathbb F_{p^n}\) with the successive resultants algorithm
Uses Software
This page was built for publication: A Generalised Successive Resultants Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5267797)
