Generalized strong pseudoprime tests and applications
type: Item
instance of: scholarly article
title: Generalized strong pseudoprime tests and applications
zbMATH Open document ID: 1015.11066
author: Pedro Berrizbeitia
author: T. G. Berry
published in: Journal of Symbolic Computation
publication date: 2003-08-05T00:00:00Z
Mathematics Subject Classification ID: 11Y11
Mathematics Subject Classification ID: 11A51
zbMATH DE Number: 1513055
zbMATH Keywords: generalization of Rabin-Monier theorem
zbMATH Keywords: probabilistic primality tests
zbMATH Keywords: Miller-Rabin test
zbMATH Keywords: values of cyclotomic polynomials
MaRDI profile type: Publication
full work available at URL: jsco.1999.0343
OpenAlex ID: W1983385151
cites work: On distinguishing prime numbers from composite numbers
cites work: There are infinitely many Carmichael numbers
cites work: Q3689236
cites work: Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
cites work: Q3792737
cites work: Q2785582
cites work: Riemann's hypothesis and tests for primality
cites work: Evaluation and comparison of two efficient probabilistic primality testing algorithms
cites work: Probabilistic algorithm for testing primality
cites work: Lucas Pseudoprimes
cites work: A Fast Monte-Carlo Test for Primality
DOI: 10.1006/JSCO.1999.0343
description: scientific article; zbMATH DE number 1513055