Generalized strong pseudoprime tests and applications
From MaRDI portal
DOI10.1006/JSCO.1999.0343zbMATH Open1015.11066OpenAlexW1983385151MaRDI QIDQ1582299FDOQ1582299
Authors: Pedro Berrizbeitia, T. 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
Recommendations
Miller-Rabin testprobabilistic primality testsgeneralization of Rabin-Monier theoremvalues of cyclotomic polynomials
Cites Work
- On distinguishing prime numbers from composite numbers
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- There are infinitely many Carmichael numbers
- Title not available (Why is that?)
- A Fast Monte-Carlo Test for Primality
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
- Lucas Pseudoprimes
- Title not available (Why is that?)
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- Title not available (Why is that?)
Cited In (9)
- Title not available (Why is that?)
- On the effectiveness of a generalization of Miller's primality theorem
- A probable prime test with very high confidence for \(n \equiv 3\mod4\)
- A faster pseudo-primality test
- Recent developments in primality testing
- A generalization of Miller’s primality theorem
- A primality test for 𝐾𝑝ⁿ+1 numbers
- On the number of primality witnesses of composite integers
- Euler pseudoprime polynomials and strong pseudoprime polynomials
This page was built for publication: Generalized strong pseudoprime tests and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582299)
