Factorization of integers
type: Item
instance of: scholarly article
title: Factorization of integers
zbMATH Open document ID: 1159.11325
published in: Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV)
publication date: 2000-07-06T00:00:00Z
review text: The author provides a very readable survey of methods for factoring integers and primality testing. The tests include several probable prime tests, J. L. Selfridge's converse to Fermat's little theorem and the Goldwasser-Kilian elliptic curve primality test. The factorization algorithms described are trial division, J. M. Pollard's \(\rho\) and \(p-1\) algorithms, the elliptic curve method of H. W. Lenstra jun., Fermat's difference of squares method, the continued fraction algorithm, the quadratic sieve and the number field sieve. In the last section she discusses factoring integers on a quantum computer.
reviewed by: Olaf Ninnemann
Mathematics Subject Classification ID: 11Y05
Mathematics Subject Classification ID: 11Y11
Mathematics Subject Classification ID: 11A51
zbMATH DE Number: 1470814
zbMATH Keywords: algorithms
zbMATH Keywords: prime numbers
author: Gabriele Nebe
MaRDI profile type: Publication
Recommended article: Q4276631
Recommended article: Factoring integers
Recommended article: Integer factoring
Recommended article: On the Factorization of Integers
Recommended article: Factorization of large integers
Recommended article: Q3737490
Recommended article: Q3633738
Recommended article: Q3932864
description: scientific article; zbMATH DE number 1470814