Computational Methods in Public Key Cryptology (2002)

Cached

Download Links

by Arjen K. Lenstra
Citations:1 - 1 self

Documents Related by Co-Citation

3 Technical report implementing the number field sieve – J Buhler, P L Montgomery, R Robson, R Ruby - 1994
1 Liniensieben und Quadratwurzelberechnung für das Zahlkörpersieb – F Bahr - 2005
1 A world wide number field sieve factoring record: on to 512 bits – R M Elkenbracht-Huizing, A K Lenstra, P L Montgomery, J Zayer - 1996
1 Polynomial selection, talk presented at the CADO workshop on integer factorization – T Kleinjung - 2008
1 Modelling the Yield of Number Field Sieve – B A Murphy - 1998
12 Computing A Square Root For The Number Field Sieve – Jean-marc Couveignes - 1993
18 Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm – Emmanuel Thomé
11 et al, Factorization of a 512-bit RSA modulus – S Cavallar
5 Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers – T Kleinjung
3 Square roots of products of algebraic numbers, http://ftp.cwi.nl/pub/pmontgom/sqrt.ps.gz – Peter L Montgomery
3 CONTINUED FRACTIONS AND LATTICE SIEVING – Jens Franke, Thorsten Kleinjung
14 Lattice Sieving and Trial Division – R Golliver, A K Lenstra, K S McCurley - 1994
21 Factoring Numbers Using Singular Integers – L M Adleman - 1991
9 Algorithms in number theory, Chapter 12 – A K Lenstra, H W Lenstra - 1990
50 The factorization of the ninth Fermat number – A K Lenstra, H W Lenstra Jr, M S Manasse, J M Pollard - 1993
32 Factorization of a 512-bit RSA modulus – S. Cavallar, W. M. Lioen, H. J. J. Te Riele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. Murphy Et Al - 2000
28 Solving linear equations over GF(2): block Lanczos algorithm, Linear algebra and its applications 192 – D Coppersmith - 1993
12 A Montgomery-like Square Root for the Number Field Sieve – Phong Nguyen - 1998
126 editors. The Development of the Number Field Sieve – A K Lenstra, H W Lenstra - 1993