Factoring polynomials over finite fields

DOI10.1142/S1793042121500469zbMath1471.11288OpenAlexW3115657237MaRDI QIDQ5009083

Enver Ozdemir

Publication date: 19 August 2021

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042121500469

zbMATH Keywords

Jacobianfinite fieldspolynomial factorizationhyperelliptic curvesPicard group

Mathematics Subject Classification ID

Jacobians, Prym varieties (14H40) Polynomials over finite fields (11T06) Arithmetic algebraic geometry (Diophantine geometry) (11G99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Abeliants and their application to an elementary construction of Jacobians.
• Computing Frobenius maps and factoring polynomials
• Equivalence relations on algebraic curves
• Generalized jacobian varieties
• Arithmetic on superelliptic curves
• Asymptotically fast group operations on Jacobians of general curves
• Computing in the Jacobian of a Hyperelliptic Curve
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Linear algebra algorithms for divisors on an algebraic curve
• The arithmetic of certain cubic function fields
• Advanced Topics in Computional Number Theory
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Factoring Polynomials Over Large Finite Fields
• Algorithmic Number Theory

This page was built for publication: Factoring polynomials over finite fields