|
1
|
Trading Time for Space in Prime Number Sieves
– Jonathan P. Sorenson
- 1998
|
|
6
|
Order computations in generic groups
– Andrew V. Sutherland
- 2007
|
|
3
|
Primality Testing Revisited
– J.H. Davenport
- 1992
|
|
1
|
Finding strong pseudoprimes to several bases. II,Math
– Zhenxiang Zhang, Min Tang
|
|
|
TWO KINDS OF STRONG PSEUDOPRIMES UP TO 10 36
– Zhenxiang Zhang
|
|
2
|
A one-parameter quadratic-base version of the Baillie–PSW probable prime test
– Zhenxiang Zhang
|
|
8
|
On Constructing 1-1 One-Way Functions
– Oded Goldreich, Leonid A. Levin, Noam Nisan
- 1995
|
|
|
Cryptographic Primitives
– Paul Garrett
- 2007
|
|
|
Primality testing
– Richard P. Brent
- 2003
|
|
|
.1 Primality testing cont'd.
– The Miller-Rabin Primality
|
|
3
|
Primality testing
– Richard P
- 1992
|
|
20
|
The Generation of Random Numbers That Are Probably Prime
– Pierre Beauchemin, Gilles Brassard, Claude Crepeau, Claude Goutier, Carl Pomerance
- 1988
|
|
1
|
Primality Testing with Fewer Random Bits
– René Peralta, Victor Shoup
- 1993
|
|
3
|
Approximating the number of integers without large prime factors
– Koji Suzuki
- 2004
|
|
1
|
Iterated Absolute Values of Differences of Consecutive Primes
– Andrew M. Odlyzko
- 1993
|
|
2
|
Improved Incremental Prime Number Sieves
– Paul Pritchard
- 1994
|
|
3
|
Results and estimates on pseudopowers
– Eric Bach, Richard Lukes, Jeffrey Shallit, H. C. Williams
- 1996
|
|
|
Faster Algorithms To Find Non-Squares Modulo Worst-Case Integers
– Daniel Bernstein
|
|
|
Doubly focused enumeration of
– Daniel J. Bernstein
|
