Computational Methods in Public Key Cryptology (2002)

Cached

Download Links

by Arjen K. Lenstra
Citations:1 - 1 self

Documents Related by Co-Citation

2980 A Method for Obtaining Digital Signatures and Public-Key Cryptosystems – R.L. Rivest, A. Shamir, L. Adleman - 1978
276 Shift-register Synthesis and BCH Decoding – J L Massey - 1969
127 eds.), The development of the number field sieve – A K Lenstra, H W Lenstra - 1993
60 Solving homogeneous linear equations overGF (2) via block Wiedemann algorithm – D Coppersmith - 1994
55 Analysis and comparison of some integer factoring algorithms, in: Computational Methods in Number Theory – C Pomerance - 1982
55 The quadratic sieve factoring algorithm – C Pomerance - 1985
49 The factorization of the ninth Fermat number – Arjen K Lenstra, H W Lenstra Jr, M S Manasse, J M Pollard - 1993
40 A tale of two sieves – Carl Pomerance - 1996
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
29 A method of factoring and the factorization of F7 – M Morrison, J Brillhart - 1975