|
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
|
|
337
|
Modular multiplication without trial division
– P L Montgomery
- 1985
|
|
4
|
Integer Factorization Based on Elliptic Curve Method: Towards Better Exploitation of Reconfigurable Hardware
– Giacomo De Meulenaer, François Gosset, Guerric Meurice De Dormale, Jean-jacques Quisquater
|
|
149
|
Speeding the Pollard and elliptic curve methods of factorization
– P L Montgomery
- 1987
|
|
31
|
Breaking Ciphers with COPACOBANA -- A Cost-Optimized Parallel Code Breaker
– Sandeep Kumar, Christof Paar, Jan Pelzl, Gerd Pfeiffer, Manfred Schimmler
- 2006
|
|
11
|
Precise Bounds for Montgomery Modular Multiplication and Some
– C D Walter
- 2002
|
|
2
|
A Simpler Sieving Device
– W Geiselmann, F Januszewski, H K opfer, J Pelzl, R Steinwandt
- 2006
|
|
2
|
Simplifying Quotient Determination
– H Orup
- 1995
|
|
2
|
on Special Purpose Hardware for Attacking Cryptographic Systems
– Workshop SHARCS’05
- 2005
|
|
6
|
Area-Time Efficient Hardware Architecture for Factoring Integers with the Elliptic Curve Method
– Jan Pelzl, Martin S ˇ Imka, Thorsten Kleinjung, Jens Franke, Christine Priplata, Colin Stahlke, Milos ˇ Drutarovsky, Viktor Fischer, Christof Paar
- 2005
|
|
17
|
Recent progress and prospects for integer factorisation algorithms
– Richard P. Brent
- 2000
|
|
8
|
SHARK — A Realizable Special Hardware Sieving Device for Factoring 1024-bit Integers
– Jens Franke, Thorsten Kleinjung, Christof Paar, Jan Pelzl, Christine Priplata, Colin Stahlke
- 2005
|
|
9
|
Long Modular Multiplication for Cryptographic Applications
– Laszlo Hars
- 2004
|
|
7
|
Modular exponentiation using parallel multipliers
– S. H. Tang, K. S. Tsui, P. H. W. Leong
- 2003
|
|
6
|
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
– Willi Geiselmann, Adi Shamir, Rainer Steinw, Eran Tromer
- 2005
|
|
4
|
Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024 bit integers
– T Kleinjung
|
|
32
|
A tale of two sieves
– Carl Pomerance
- 1996
|
|
108
|
The development of the number field sieve
– A K Lenstra, H W Lenstra
- 1993
|