An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
type: Item
instance of: scholarly article
title: An improvement of Rabin's probabilistic algorithm for generating irreducible polynomials over GF(p)
zbMATH Open document ID: 0456.68034
DOI: 10.1016/0020-0190(80)90011-3
author: Jacques Calmet
author: Rüdiger Loos
published in: Information Processing Letters
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3714914
zbMATH Keywords: computer algebra
zbMATH Keywords: polynomial factorization
zbMATH Keywords: average computing time
MaRDI profile type: Publication
full work available at URL: 0020-0190(80)90011-3
OpenAlex ID: W2061874356
cites work: Probabilistic Algorithms in Finite Fields
cites work: Q4164569
cites work: Factoring Polynomials Over Large Finite Fields
cites work: Q5585020
description: scientific article; zbMATH DE number 3714914