Factoring on a computer

DOI10.1007/BF03024126MaRDI QIDQ799723zbMATH OpenFDO

Authors Hugh C. Williams

Publication date 1984

Published in The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF03024126

zbMATH Keywords

computational number theoryfactoring methodslarge computersparallel processingprogrammable calculatorssmall computerssurvey

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to number theory (11-02) Software, source code, etc. for problems pertaining to number theory (11-04) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16)

Review text

This is a survey of methods for factorization, distinguishing between the methods suitable for programmable calculators, small computers, and large computers. Possible improvements using parallel processing are considered.

Cites work

• A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers
• A design for a number theory package with an optimized trial division routine
• A Method of Factoring and the Factorization of F 7
• A monte carlo method for factorization
• A p + 1 Method of Factoring
• Factoring Large Numbers with a Quadratic Sieve
• Factorization of the Eighth Fermat Number
• Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High Powers
• scientific article; zbMATH DE number 3885978 (Why is no real title available?)
• scientific article; zbMATH DE number 4041784 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3767743 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• scientific article; zbMATH DE number 3528292 (Why is no real title available?)
• scientific article; zbMATH DE number 3630832 (Why is no real title available?)
• scientific article; zbMATH DE number 3801619 (Why is no real title available?)
• Implementing the Continued Fraction Factoring Algorithm on Parallel Machines
• On distinguishing prime numbers from composite numbers
• Primality Testing and Jacobi Sums
• Recent developments in primality testing

Cited in

(4)

• Simplified theory of boolean functions
• Factoring Numbers on the Massively Parallel Computer
• scientific article; zbMATH DE number 5192057 (Why is no real title available?)
• Factoring: algorithms, computations, and computers

Describes a project that uses

Uses Software

• CFRAC

This page was built for publication: Factoring on a computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799723)