Fast construction of irreducible polynomials over finite fields

DOI10.1007/s11856-012-0070-8zbMath1287.11141arXiv0905.1642OpenAlexW2168517325MaRDI QIDQ5917943

Jean-Marc Couveignes, Reynald Lercier

Publication date: 18 June 2013

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.1642

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06) Randomized algorithms (68W20)

Related Items (8)

Fast computation of elliptic curve isogenies in characteristic two ⋮ On the complexity exponent of polynomial system solving ⋮ Elimination ideal and bivariate resultant over finite fields ⋮ Breaking SIDH in polynomial time ⋮ Genus 2 point counting over prime fields ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Characterization and enumeration of good punctured polynomials over finite fields ⋮ Modular composition via factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Complex multiplication structure of elliptic curves
• Fast computation of special resultants
• Remarque sur une formule de Shimura-Taniyama
• Finding Isomorphisms Between Finite Fields
• ON THE PROBLEM OF JACOBSTHAL
• Analysis of Ben-Or's polynomial irreducibility test
• Abelian varieties over finite fields

This page was built for publication: Fast construction of irreducible polynomials over finite fields