Generalized strong pseudoprime tests and applications

DOI10.1006/JSCO.1999.0343MaRDI QIDQ1582299zbMATHOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• Recent developments in primality testing
• A generalization of Miller’s primality theorem
• Four primality testing algorithms
• A new probabilistic primality test
• Strong pseudoprimes to twelve prime bases

Cites work

• scientific article; zbMATH DE number 981695 (Why is no real title available?)
• scientific article; zbMATH DE number 3912454 (Why is no real title available?)
• scientific article; zbMATH DE number 4057589 (Why is no real title available?)
• A Fast Monte-Carlo Test for Primality
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• Lucas Pseudoprimes
• 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

Cited in

(9)

• Euler pseudoprime polynomials and strong pseudoprime polynomials
• scientific article; zbMATH DE number 691479 (Why is no real title available?)
• Recent developments in primality testing
• A faster pseudo-primality test
• A generalization of Miller’s primality theorem
• A probable prime test with very high confidence for \(n \equiv 3\mod4\)
• On the number of primality witnesses of composite integers
• A primality test for \(Kp^{n}+1\) numbers
• On the effectiveness of a generalization of Miller's primality theorem

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)