Algebraic algorithms in GF(q)
type: Item
instance of: scholarly article
title: Algebraic algorithms in GF(q)
zbMATH Open document ID: 0578.68033
DOI: 10.1016/0012-365X(85)90017-2
published in: Discrete Mathematics
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 12-04
Mathematics Subject Classification ID: 11T99
zbMATH DE Number: 3926239
zbMATH Keywords: large Galois Fields
zbMATH Keywords: ALDES/SAC2 computer algebra system
author: Jacques Calmet
MaRDI profile type: Publication
cites work: Factoring Polynomials Over Large Finite Fields
cites work: Computer algebra. EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
cites work: An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
cites work: Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
cites work: A New Algorithm for Factoring Polynomials Over Finite Fields
cites work: Q3959424
cites work: Q5585020
cites work: Q4164569
cites work: Probabilistic algorithm for testing primality
cites work: Probabilistic Algorithms in Finite Fields
description: scientific article; zbMATH DE number 3926239