|
7
|
Checking the odd Goldbach conjecture up to 10 20
– Yannick Saouter
- 1998
|
|
3
|
Some Primality Testing Algorithms
– R.G.E. Pinch
- 1993
|
|
20
|
Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters
– Ueli M. Maurer
- 1995
|
|
2
|
On Generalized Carmichael Numbers
– Lorenz Halbeisen, Norbert Hungerbühler
- 2000
|
|
|
unknown title
– unknown authors
|
|
6
|
A complete Vinogradov 3-primes theorem under the Riemann hypothesis
– J. -m. Deshouillers, G. Effinger, H. Te Riele, D. Zinoviev, Communicated Hugh Montgomery
- 1997
|
|
|
Codes -- The Guide to Secrecy . . .
– Richard A. Mollin
|
|
1
|
Finding strong pseudoprimes to several bases. II,Math
– Zhenxiang Zhang, Min Tang
|
|
|
TWO KINDS OF STRONG PSEUDOPRIMES UP TO 10 36
– Zhenxiang Zhang
|
|
|
NOTES ON SOME NEW KINDS OF PSEUDOPRIMES
– Zhenxiang Zhang
|
|
|
MO419 – Probabilistic Algorithms – Flávio K. Miyazawa – IC/UNICAMP 2010 A survey on Probabilistic Algorithms to Primality Test
– Marcio Machado, Pereira Ra, Marco Alves, Ganhoto Ra
|
|
9
|
Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm
– François Morain
- 1988
|
|
138
|
Elliptic Curves And Primality Proving
– A. O. L. Atkin, F. Morain
- 1993
|
|
2
|
A one-parameter quadratic-base version of the Baillie–PSW probable prime test
– Zhenxiang Zhang
|
|
|
Vinogradov's Theorem Is True Up To 10^20
– Yannick Saouter, Yannick Saouter
- 1995
|
|
|
Theorem
– D. R. Heath-brown
|
|
|
Carmichael numbers and pseudoprimes Notes by G.J.O. Jameson
– unknown authors
|
|
|
Notes by G.J.O. Jameson
– unknown authors
|
|
2
|
Building Pseudoprimes With A Large Number Of Prime Factors
– D. Guillaume, F. Morain
- 1995
|
