Evaluation and comparison of two efficient probabilistic primality testing algorithms
type: Item
instance of: scholarly article
title: Evaluation and comparison of two efficient probabilistic primality testing algorithms
zbMATH Open document ID: 0443.10002
DOI: 10.1016/0304-3975(80)90007-9
author: Louis Monier
published in: Theoretical Computer Science
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 11A41
Mathematics Subject Classification ID: 11N05
zbMATH DE Number: 3691416
zbMATH Keywords: probabilistic primality testing
zbMATH Keywords: efficiency
zbMATH Keywords: algorithm
zbMATH Keywords: Miller-Rabin test
Wikidata QID: Q27940855
MaRDI profile type: Publication
full work available at URL: 0304-3975(80)90007-9
OpenAlex ID: W2089613796
cites work: Q4073422
cites work: Q3259107
cites work: Q4092051
cites work: Q5585020
cites work: Q4140386
cites work: Q4164569
cites work: Fast multiplication of large numbers
cites work: A Fast Monte-Carlo Test for Primality
DBLP publication ID: journals/tcs/Monier80
description: scientific article; zbMATH DE number 3691416