The Rabin-Monier theorem for Lucas pseudoprimes (1997)

Cached

Download Links

by F. Arnault
Venue:Math. Comp
Citations:3 - 0 self

Documents Related by Co-Citation

192 A probabilistic algorithm for testing primality – Michael Rabin - 1980
15 The pseudoprimes to 25 – C Pomerance, J L Selfridge, S S Wagstaff - 1980
20 Evaluation and comparison of two efficient probabilistic primality testing algorithms – L Monier - 1980
36 Unsolved Problems in Number Theory, Second edition – R K Guy - 1994
11 A Probable Prime Test With High Confidence – Jon Grantham
3 On Numbers Analogous to the Carmichael Numbers.” Canad – H C Williams - 1977
207 Riemann’s hypothesis and tests for primality – Gary L Miller - 1976
1 Intelligent Primality Test Offer, Computational Perspectives on Number Theory – A O L Atkin - 1998
1 A new primality test using Lucas sequences, preprint – Zhaiyu Mo, James P Jones
1 Evaluating recurrences of form Xm+n = f(Xm ; Xn ; Xm\Gamman ) via Lucas chains, preprint – Peter L Montgomery
1 Are there counter-examples to the Baillie -- PSW primality test?, Dopo Le Parole aangeboden aan Dr – Carl Pomerance - 1984
17 Strong Primality Tests That Are Not Sufficient – W Adams, D Shanks - 1982
7 Frobenius Pseudoprimes – Jon Grantham
22 The Generation of Random Numbers That Are Probably Prime – Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance - 1988
2190 The Art of Computer Programming – Donald Knuth - 1973
1 Primality testing, Computational Methods in Number Theory – H W Lenstra - 1982
1 Using Lucas sequences to factor large integers near group orders, The Fibonacci Quarterly – Zhenxiang Zhang
2 A.Granville and C.Pomerance, There are infinitely many Carmichael numbers – W R Alford - 1994
2 A.Granville and C.Pomerance, On the difficulty of finding reliable witnesses, Algorithmic Number Theory – W R Alford - 1994