Primality testing with fewer random bits
type: Item
instance of: scholarly article
title: Primality testing with fewer random bits
zbMATH Open document ID: 0791.11071
DOI: 10.1007/BF01275488
author: René Peralta
author: Victor Shoup
published in: Computational Complexity
publication date: 1994-05-08T00:00:00Z
Mathematics Subject Classification ID: 11Y11
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 561484
zbMATH Keywords: randomized algorithms
zbMATH Keywords: derandomization
zbMATH Keywords: primality testing algorithms
zbMATH Keywords: error probabilities
zbMATH Keywords: Miller-Rabin test
zbMATH Keywords: Solovay-Strassen test
Wikidata QID: Q62472242
MaRDI profile type: Publication
cites work: Realistic analysis of some randomized algorithms
cites work: Factoring polynomials using fewer random bits
cites work: Q5772619
cites work: Randomized algorithms and pseudorandom numbers
cites work: Q3216750
cites work: Riemann's hypothesis and tests for primality
cites work: Probabilistic algorithm for testing primality
cites work: A Fast Monte-Carlo Test for Primality
full work available at URL: https://doi.org/10.1007/bf01275488
OpenAlex ID: W2025184368
DBLP publication ID: journals/cc/PeraltaS93
description: scientific article; zbMATH DE number 561484