Cites work
- 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?)
- A Method of Factoring and the Factorization of F 7
- 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 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
- 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)
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)