Factoring large numbers with a quadratic sieve-Reference-Cited by-同舟云学术

Factoring large numbers with a quadratic sieve

Published:1983 Issue:163 Volume:41 Page:287-294
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Gerver Joseph L.

Abstract

The quadratic sieve algorithm was used to factor a 47-digit number into primes. A comparison with Wagstaff’s results using the continued fraction early abort algorithm suggests that QS should be faster than CFEA when the number being factored exceeds 60 digits (plus or minus ten or more digits, depending on details of the hardware and software).

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1983-41-163/S0025-5718-1983-0701639-4/S0025-5718-1983-0701639-4.pdf

Reference10 articles.

1. J. Brillhart, D. H. Lehmer, J. L. Selfridge, B. Tuckerman & S. S. Wagstaff, Jr., "Factorizations of 𝑏ⁿ±1 up to high powers." (To appear).

2. On a problem of Oppenheim concerning “factorisatio numerorum”;Canfield, E. R.;J. Number Theory,1983

3. Rapid multiplication of rectangular matrices;Coppersmith, D.;SIAM J. Comput.,1982

4. Asymptotically fast factorization of integers;Dixon, John D.;Math. Comp.,1981

5. Computer technology applied to the theory of numbers;Lehmer, D. H.,1969

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

1. Wie man eine Zahl faktorisiert;Grundlagen der Kryptographie;2024

2. How to Factor a Number;Undergraduate Topics in Computer Science;2021

3. Digital Signature Schemes Based on Two Hard Problems;Detecting and Mitigating Robotic Cyber Security Risks;2017

4. Fast matrix decomposition inF2;Journal of Computational and Applied Mathematics;2014-04

5. Introduction: How to Use this Book;Algebraic Cryptanalysis;2009