|
199
|
Factoring integers with elliptic curves
– H W Lenstra
- 1987
|
|
2507
|
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems
– R.L. Rivest, A. Shamir, L. Adleman
- 1978
|
|
163
|
Probabilistic algorithm for testing primality
– Michael Rabin
- 1980
|
|
154
|
Elliptic curves over finite fields and the computation of square roots mod p
– René Schoof
- 1985
|
|
2292
|
New Directions in Cryptography
– Whitfield Diffie, Martin E. Hellman
- 1976
|
|
102
|
On distinguishing prime numbers from composite numbers
– Leonard M Adleman, Carl Pomerance, Robert S Rumely
- 1983
|
|
45
|
Primality Testing And Abelian Varieties Over Finite Fields (Springer-Verlag
– L M Adleman, M-D A Huang
- 1992
|
|
559
|
Elliptic curve cryptosystems
– N Koblitz
- 1987
|
|
961
|
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm
– T ElGamal
- 1985
|
|
122
|
A fast Monte-Carlo test for primality
– R Solovay, V Strassen
- 1977
|
|
419
|
Use of elliptic curves in cryptography
– V Miller
- 1986
|
|
181
|
Riemann’s hypothesis and tests for primality
– G Miller
- 1976
|
|
687
|
The arithmetic of elliptic curves
– J H Silverman
- 1995
|
|
52
|
Recognizing primes in random polynomial time
– L M Adleman, M A Huang
- 1987
|
|
243
|
Reducing elliptic curve logarithms to logarithms in a finite field
– A Menezes, T Okamoto, S A Vanstone
- 1993
|
|
41
|
Non-interactive Public-key Cryptography
– U Maurer, Y Yacobi
- 1992
|
|
61
|
Theorems of factorization and primality testing
– John M Pollard
- 1974
|
|
262
|
Elliptic Curve Public Key Cryptosystems
– Alfred Menezes
- 1993
|
|
89
|
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
– D V Chudnovsky, G V Chudnovsky
- 1986
|
