Finding roots in with the successive resultants algorithm

DOI10.1112/S1461157014000138zbMath1296.11166WikidataQ62047247 ScholiaQ62047247MaRDI QIDQ2878836

Christophe Petit

Publication date: 5 September 2014

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial equationselliptic curve discrete logarithm problemsuccessive resultants algorithm

Mathematics Subject Classification ID

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)

Related Items (1)

A Generalised Successive Resultants Algorithm

Uses Software

• Magma

Cites Work

• Unnamed Item
• Fast multiplication of polynomials over fields of characteristic 2
• Computing Frobenius maps and factoring polynomials
• Fast computation of continued fraction expansions.
• Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
• Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
• Fast Polynomial Factorization and Modular Composition
• Probabilistic Algorithms in Finite Fields
• Subgroup Refinement Algorithms for Root Finding in $GF(q)$
• Subquadratic-time factoring of polynomials over finite fields
• A geometric approach to root finding in GT(q/sup m/)
• On the solution of algebraic equations over finite fields
• Factoring polynomials over finite fields: A survey

This page was built for publication: Finding roots in with the successive resultants algorithm