Finding strong pseudoprimes to several bases. II,Math

by Zhenxiang Zhang , Min Tang
Venue:Department of Mathematics, Anhui Normal University
Citations:1 - 1 self

Documents Related by Co-Citation

1 All Carmichael numbers with three prime factors up to 1018 , http://www. chalcedon.demon.co.uk/carpsp.html – R G E Pinch
13 Efficiency and Security of Cryptosystems Based on Number Theory – Daniel Bleichenbacher - 1996
15 The pseudoprimes to 25 – C Pomerance, J L Selfridge, S S Wagstaff - 1980
7 Finding strong pseudoprimes to several bases – Zhenxiang Zhang
2 Constructing Carmichael numbers which are strong pseudoprimes to several bases – F Arnault - 1995
3 Average case estimates for the strong probable prime test – I Damg˚ard, P Landrock, C Pomerance - 1993
15 On strong pseudoprimes to several bases – Gerhard Jaeschke
205 Riemann’s hypothesis and tests for primality – G L Miller
133 Prime numbers: a computational perspective – R Crandall, C Pomerance - 2005
71 There are infinitely many Carmichael numbers – W. R. Alford, Andrew Granville, Carl Pomerance - 1982
190 A probabilistic algorithm for testing primality – Michael Rabin - 1980