Algebraic algorithms in GF(q)

DOI10.1016/0012-365X(85)90017-2zbMath0578.68033MaRDI QIDQ1066670

Jacques Calmet

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

ALDES/SAC2 computer algebra systemlarge Galois Fields

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite fields and commutative rings (number-theoretic aspects) (11T99) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (4)

Univariate polynomial factorization over finite fields ⋮ Irreducible compositions of polynomials over finite fields of even characteristic ⋮ Computational problems in the theory of finite fields ⋮ Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.

Cites Work

• Probabilistic algorithm for testing primality
• An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
• Computer algebra. EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
• Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
• Probabilistic Algorithms in Finite Fields
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algebraic algorithms in GF(q)