Factoring on a computer

DOI10.1007/BF03024126zbMATH Open0548.10004MaRDI QIDQ799723FDOQ799723

Authors: Hugh C. Williams 

Publication date: 1984

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

zbMATH Keywords

surveyparallel processingcomputational number theoryfactoring methodslarge computersprogrammable calculatorssmall computers

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Factoring: algorithms, computations, and computers
• Title not available (Why is that?)
• Factoring Numbers on the Massively Parallel Computer
• Simplified theory of boolean functions

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)