1 |
T. ElGmal, A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory 31(4), pp. 469-472 (1985)
DOI
|
2 |
IEEE P1363: Standard for Public-Key Cryptography (2000
|
3 |
National Institute for Standards and Technology, Digital Signature Standard(DSS), Fedral Register 56 169 (1991)
|
4 |
J. Shawe-Taylor, Generating strong primes, Electronics Letters 22(16), pp. 875-877 (1986)
DOI
ScienceOn
|
5 |
M.O. Rabin, Probabilistic Algorithm for Primality Testing, Journal of Number Theory 12, pp. 128- 138 (1980)
DOI
|
6 |
J. Grantham, A probable prime test with high confidence, Journal of Number Theory 72, pp. 32- 47 (1998)
DOI
ScienceOn
|
7 |
OpenSSL, http://openssl.org/
|
8 |
D.J. Lehmann, On primality tests, SIAM Journal of Computing 11(2), pp. 374-375 (1982)
DOI
|
9 |
W. Diffie and M.E. Hellman, New directions in cryptography, IEEE transactions on Information Theory, 22(6), pp. 644-654 (1976)
DOI
|
10 |
Public-Key Cryptography Standards, PKCS #1 RSA Cryptography Standard
|
11 |
R. Solovay and V. Strassen, A fast Monte-Carlo test for primality, SIAM Journal on Computing 6, pp. 84-85 (1977)
DOI
|
12 |
G.L. Miller, Riemann's Hypothesis and Tests for Primality, Journal of Computer Systems Science 13(3), pp. 300-317 (1976)
DOI
ScienceOn
|
13 |
W. Bosma and M.P. van der Hulst, Faster primality testing, CRYPTO'89, LNCS 435, pp. 652-656 (1990)
|
14 |
A.O.L. Atkin and F. Morain, Elliptic curves and primality proving, Mathematics of Computation 61, pp. 29-63 (1993)
DOI
ScienceOn
|
15 |
U.M. Maurer, Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters, Journal of Cryptology 8(3), pp. 123-155 (1995)
|
16 |
The GNU Crypto project, http://www.gnu.org/software/ gnu-crypto/
|
17 |
T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2nd ed, MIT press (1991)
|
18 |
C. Pomerance, On the Distribution of Pseudoprimes, Mathematics of Computation, 37(156), pp. 128-138, 1981
|
19 |
R.L. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures an public-key cryptosystems, Communications of the ACM 21(2) pp. 120-126 (1978)
DOI
ScienceOn
|
20 |
N. Koblitz, A Course in Number Theory and Cryptography, Berlin: Springer (1987)
|
21 |
R.D. Carmichael, On composite numbers P which satisfy the Fermat congruence (mod P), Amer. Math. Monthly 19, pp. 22-27, 1912
DOI
ScienceOn
|
22 |
H.C. Pocklington, The determination of the prime or composite nature of large numbers by Fermat's theorem, Proc. of the Cambridge Philosophical Society 18, pp. 29-30 (1914)
|
23 |
M. Joye, P. Paillier, and S. Vaudenay, Efficient Generation of Prime Numbers, CHES 2000, LNCS 1965, pp. 340-354 (2000)
|
24 |
H. Riesel, Prime numbers and computer methods for factorization, Boston, Basel, Stuttgart: Birkhauser, (1985)
|
25 |
A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, (1997)
|
26 |
nternational Organization for Standard, ISO/IEC 18032: Prime Number Generation (2005)
|