Smoothness testing of polynomials over finite fields

DOI10.3934/AMC.2014.8.459MaRDI QIDQ2513763zbMATH OpenOpenAlexFDO

Authors Jean-François Biasse, Michael J. Jacobson jun.

Publication date 28 January 2015

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/da5184a355882ad1c1734eff038802061b90f436

zbMATH Keywords

finite fieldpolynomialsmoothness testing

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Recommendations

• Smoothness test for polynomials defined over small characteristic finite fields
• Smoothness and factoring polynomials over finite fields
• scientific article; zbMATH DE number 1186945
• Testing Polynomials over General Fields
• Deterministic irreducibility testing of polynomials over large finite fields
• SMOOTHNESS IN PENCILS OF HYPERSURFACES OVER FINITE FIELDS
• scientific article; zbMATH DE number 1008373
• Testing low-degree polynomials over prime fields
• Polynomial interpolation and identity testing from high powers over finite fields

Cites work

• A general framework for subexponential discrete logarithm algorithms
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Computing Frobenius maps and factoring polynomials
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Factoring integers with elliptic curves
• Fast evaluation of logarithms in fields of characteristic two
• Fast multiplication of large numbers
• scientific article; zbMATH DE number 3956969 (Why is no real title available?)
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• Practical improvements to class group and regulator computation of real quadratic fields
• Solving elliptic curve discrete logarithm problems using Weil descent

Cited in

(5)

• Smoothness test for polynomials defined over small characteristic finite fields
• Jacobian Versus Infrastructure in Split Hyperelliptic Curves
• A hyperelliptic smoothness test. I
• SMOOTHNESS IN PENCILS OF HYPERSURFACES OVER FINITE FIELDS
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

Describes a project that uses

Uses Software

• NTL

This page was built for publication: Smoothness testing of polynomials over finite fields

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