Factorization of a 768-Bit RSA Modulus
Top Cited Papers
- 1 January 2010
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A Kilobit Special Number Field Sieve FactorizationPublished by Springer Nature ,2007
- On polynomial selection for the general number field sieveMathematics of Computation, 2006
- COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGYPublished by World Scientific Pub Co Pte Ltd ,2002
- Factorization of a 512-Bit RSA ModulusPublished by Springer Nature ,2000
- Strategies in Filtering in the Number Field SievePublished by Springer Nature ,2000
- A World Wide Number Field Sieve factoring record: On to 512 bitsPublished by Springer Nature ,1996
- Lattice sieving and trial divisionPublished by Springer Nature ,1994
- Solving linear equations over GF(2): block Lanczos algorithmLinear Algebra and its Applications, 1993
- The development of the number field sievePublished by Springer Nature ,1993
- Asymptotically fast factorization of integersMathematics of Computation, 1981