A Generalised Successive Resultants Algorithm
From MaRDI portal
Publication:5267797
DOI10.1007/978-3-319-55227-9_9zbMath1409.11134OpenAlexW2592460274MaRDI QIDQ5267797
Benjamin Pring, Christophe Petit, 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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic root finding over finite fields using Graeffe transforms
- On the deterministic complexity of factoring polynomials over finite fields
- Smoothness and factoring polynomials over finite fields
- Algebraic Approaches for the Elliptic Curve Discrete Logarithm Problem over Prime Fields
- Randomized Root Finding over Finite FFT-fields using Tangent Graeffe Transforms
- Modern Computer Algebra
- Finding roots in with the successive resultants algorithm
- How to Hash into Elliptic Curves
- Fast Polynomial Factorization and Modular Composition
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Galois Groups and Factoring Polynomials over Finite Fields
- Deterministic polynomial factoring and association schemes
- Factoring Polynomials Over Large Finite Fields
- Factoring polynomials over finite fields: A survey
- On the deterministic complexity of factoring polynomials
This page was built for publication: A Generalised Successive Resultants Algorithm