Modern factorization methods
type: Item
instance of: scholarly article
title: Modern factorization methods
zbMATH Open document ID: 0607.10005
DOI: 10.1007/BF01934998
author: Hans Riesel
published in: BIT
publication date: 1985-01-01T00:00:00Z
review text: In this expository paper the progress in factorization of large integers since the introduction of computers is reported. Thanks to theoretical advances and refinements, as well as to more powerful computers, the practical limit of integers possible to factor has been raised considerably during the past 20 years. The present practical limit is around \(10^{75}\) if supercomputers are used and if much computer time is available.
Mathematics Subject Classification ID: 11A41
Mathematics Subject Classification ID: 11-04
Mathematics Subject Classification ID: 11-02
zbMATH DE Number: 3981248
zbMATH Keywords: Pollard's p-1-method
zbMATH Keywords: computational number theory
zbMATH Keywords: expository paper
zbMATH Keywords: factorization of large integers
describes a project that uses: CFRAC
MaRDI profile type: Publication
cites work: A monte carlo method for factorization
cites work: An improved Monte Carlo factorization algorithm
cites work: A Method of Factoring and the Factorization of F 7
cites work: Q3220644
cites work: Q4046106
cites work: A p + 1 Method of Factoring
cites work: Analysis of a simple factorization algorithm
cites work: Prime numbers and computer methods for factorization
full work available at URL: https://doi.org/10.1007/bf01934998
OpenAlex ID: W4247512137
description: scientific article; zbMATH DE number 3981248