New algorithms for generating Conway polynomials over finite fields

DOI10.1016/J.JSC.2004.03.002zbMATH Open1137.11356OpenAlexW2075227796MaRDI QIDQ2643550FDOQ2643550

Authors: Lenwood S. Heath, Nicholas A. Loehr 

Publication date: 24 August 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2004.03.002

Recommendations

• scientific article; zbMATH DE number 1305433
• Standard generators of finite fields and their cyclic subgroups
• Constructing irreducible polynomials over finite fields
• New Algorithms for Finding Irreducible Polynomials Over Finite Fields
• Fast construction of irreducible polynomials over finite fields

zbMATH Keywords

computer algebrafinite fieldsConway polynomialsMAGMAGAP

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• The Magma algebra system. I: The user language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• New algorithms for generating Conway polynomials over finite fields
• Title not available (Why is that?)
• Trace- and norm-compatible extensions of finite fields

Cited In (5)

• The-square-and-add Markov chain
• New polynomial-time algorithms for Camion bases
• Constructing thick \(B_h\)-sets
• New algorithms for generating Conway polynomials over finite fields
• Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)

Uses Software

• GAP
• Magma

This page was built for publication: New algorithms for generating Conway polynomials over finite fields

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