Evaluation and comparison of two efficient probabilistic primality testing algorithms
From MaRDI portal
Publication:1144064
DOI10.1016/0304-3975(80)90007-9zbMath0443.10002OpenAlexW2089613796WikidataQ27940855 ScholiaQ27940855MaRDI QIDQ1144064
Publication date: 1980
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(80)90007-9
Related Items
Improved error bounds for the Fermat primality test on random inputs, Fast generation of prime numbers and secure public-key cryptographic parameters., The generation of random numbers that are probably prime, The Probability that a Random Probable Prime is Composite, A generalization of Miller’s primality theorem, Multidimensional scaling and visualization of patterns in prime numbers, Finding strong pseudoprimes to several bases, Frobenius pseudoprimes, On practical aspects of the Miller-Rabin primality test, Further investigations with the strong probable prime test, The Miller–Rabin test with randomized exponents, Primality testing, On the effectiveness of a generalization of Miller's primality theorem, Two kinds of strong pseudoprimes up to $10^{36}$, Finding strong pseudoprimes to several bases. II, Realistic analysis of some randomized algorithms, An unconditional improvement to the running time of the quadratic Frobenius test, Prime witnesses in the Shor algorithm and the Miller-Rabin algorithm, A probable prime test with high confidence, On the number of primality witnesses of composite integers, Some thoughts on pseudoprimes, Average liar count for degree-$2$ Frobenius pseudoprimes, Strengthening the Baillie-PSW primality test, Counting composites with two strong liars, Generalized strong pseudoprime tests and applications, Euler pseudoprime polynomials and strong pseudoprime polynomials, The Rabin-Monier theorem for Lucas pseudoprimes, A one-parameter quadratic-base version of the Baillie-PSW probable prime test
Cites Work
