A Kilobit Special Number Field Sieve Factorization
- 1 January 2007
- book chapter
- Published by Springer Nature
- Vol. 2007, 1-12
- https://doi.org/10.1007/978-3-540-76900-2_1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann AlgorithmJournal of Symbolic Computation, 2002
- Selecting Cryptographic Key SizesJournal of Cryptology, 2001
- Factorization of a 512-Bit RSA ModulusPublished by Springer Nature ,2000
- Strategies in Filtering in the Number Field SievePublished by Springer Nature ,2000
- A Montgomery-like square root for the Number Field SievePublished by Springer Nature ,1998
- A Block Lanczos Algorithm for Finding Dependencies over GF(2)Published by Springer Nature ,1995
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann AlgorithmMathematics of Computation, 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