Smoothness testing of polynomials over finite fields

DOI10.3934/amc.2014.8.459zbMath1358.11140OpenAlexW1980718426MaRDI QIDQ2513763

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

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

Related Items (1)

Jacobian Versus Infrastructure in Split Hyperelliptic Curves

Uses Software

• NTL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Computing Frobenius maps and factoring polynomials
• Computing the endomorphism ring of an ordinary elliptic curve over a finite field
• Fast multiplication of large numbers
• A general framework for subexponential discrete logarithm algorithms
• Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
• Fast evaluation of logarithms in fields of characteristic two
• Practical Improvements to Class Group and Regulator Computation of Real Quadratic Fields

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