Generalized strong pseudoprime tests and applications

DOI10.1006/JSCO.1999.0343zbMath1015.11066OpenAlexW1983385151MaRDI QIDQ1582299

Pedro Berrizbeitia, Thomas G. Berry

Publication date: 5 August 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1999.0343

zbMATH Keywords

Miller-Rabin testprobabilistic primality testsgeneralization of Rabin-Monier theoremvalues of cyclotomic polynomials

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Related Items (3)

A generalization of Miller’s primality theorem ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ A primality test for 𝐾𝑝ⁿ+1 numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distinguishing prime numbers from composite numbers
• Probabilistic algorithm for testing primality
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Riemann's hypothesis and tests for primality
• There are infinitely many Carmichael numbers
• Lucas Pseudoprimes
• A Fast Monte-Carlo Test for Primality
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers

This page was built for publication: Generalized strong pseudoprime tests and applications