|
9
|
Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm
– François Morain
- 1988
|
|
2
|
Atkin's test: news from the front
– Franqois Morain, Dipartement De Mathkmatiques, Universitk Claude Bernard
- 1990
|
|
4
|
Elliptic Curves, Primality Proving And Some Titanic Primes
– François Morain
- 1989
|
|
138
|
Elliptic Curves And Primality Proving
– A. O. L. Atkin, F. Morain
- 1993
|
|
2
|
DISTRIBUTED PRIMALITY PROVING AND THE PRIMALITY OF (2^3539+ 1)/3
– François Morain
- 1991
|
|
39
|
Parallel Algorithms for Integer Factorisation
– Richard P. Brent
|
|
17
|
Factorization of the tenth and eleventh Fermat numbers
– Richard P. Brent
- 1996
|
|
15
|
Building Cyclic Elliptic Curves Modulo Large Primes
– François Morain
- 1987
|
|
1
|
Computational Methods in Public Key Cryptology
– Arjen K. Lenstra
- 2002
|
|
24
|
The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
– Ueli M. Maurer , Stefan Wolf
- 1998
|
|
23
|
The Diffie-Hellman Protocol
– Ueli M. Maurer, Stefan Wolf
- 1999
|
|
4
|
Analysis of DPA Countermeasures Based on Randomizing the Binary Algorithm
– Nevine Ebeid, M. Anwar Hasan
- 2003
|
|
|
Easy numbers for the Elliptic Curve Primality Proving Algorithm
– F. Morain
- 1992
|
|
23
|
Primality testing using elliptic curves
– Shafi Goldwasser, Joe Kilian
- 1999
|
|
|
High-Performance Integer Factoring with Reconfigurable Devices
– Ralf Zimmermann, Tim Güneysu, Christof Paar
- 2010
|
|
38
|
New Public-Key Schemes Based on Elliptic Curves over the Ring Z_n
– Kenji Koyama, Ueli M Maurer, Tatsuaki Okamoto, Scott A Vanstone
- 1991
|
|
8
|
Answers To Frequently Asked Questions About Today's Cryptography
– Paul Fahn
- 1993
|
|
61
|
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
– Ueli M. Maurer
- 1994
|
|
41
|
Some integer factorization algorithms using elliptic curves
– Richard P. Brent
- 1986
|
