Strategies in Filtering in the Number Field Sieve-Reference-Cited by-同舟云学术

Strategies in Filtering in the Number Field Sieve

Published:2000 Issue: Volume: Page:209-231
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cavallar Stefania

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/10722028_11

Reference19 articles.

1. Boender, H.: Factoring Large Integers with the Quadratic Sieve. PhD thesis, Rijksuniversiteit Leiden (1997)

2. Lecture Notes in Mathematics;J.P. Buhler,1993

3. Lecture Notes in Computer Science;S. Cavallar,1999

4. Cavallar, S., Dodson, B., Lenstra, A.K., Leyland, P., Lioen, W., Montgomery, P.L., te Riele, H., Zimmermann, P.: 211-digit SNFS factorization (April 1999), Available from ftp://ftp.cwi.nl/pub/herman/NFSrecords/SNFS-211

5. Cavallar, S., Dodson, B., Lenstra, A.K., Lioen, W., Montgomery, P.L., Murphy, B.H., te Riele, K., Aardal, J., Gilchrist, G., Guillerm, P., Leyland, J., Marchand, F., Morain, A., Muffett, C., Putnam, C., Putnam, P.: Zimmermann. Factorization of a 512-bit RSA modulus. Submitted to Eurocrypt (2000)

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Framework for Filtering Step of Number Field Sieve and Function Field Sieve;IETE Journal of Research;2021-06-10

2. Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment;Advances in Cryptology – CRYPTO 2020;2020

3. Sparse Gaussian Elimination Modulo p: An Update;Computer Algebra in Scientific Computing;2016

4. Key Length Estimation of Pairing-Based Cryptosystems Using η_T Pairing over GF(3ⁿ);IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2014

5. Calculation Components Analysis of the Lattice Sieve;Advanced Materials Research;2012-02