Algebraic algorithms in GF(q)

DOI10.1016/0012-365X(85)90017-2MaRDI QIDQ1066670zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4094801
• scientific article; zbMATH DE number 4094800
• Computing with algebraically closed fields
• scientific article; zbMATH DE number 4099398
• scientific article; zbMATH DE number 1189004

Cites work

• scientific article; zbMATH DE number 3780555 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• 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
• Factoring Polynomials Over Large Finite Fields
• Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
• Probabilistic Algorithms in Finite Fields
• Probabilistic algorithm for testing primality

Cited in

(8)

• scientific article; zbMATH DE number 4099398 (Why is no real title available?)
• Computational problems in the theory of finite fields
• scientific article; zbMATH DE number 4094801 (Why is no real title available?)
• Univariate polynomial factorization over finite fields
• scientific article; zbMATH DE number 1187492 (Why is no real title available?)
• scientific article; zbMATH DE number 4094800 (Why is no real title available?)
• Irreducible compositions of polynomials over finite fields of even characteristic
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.

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

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