A design for a number theory package with an optimized trial division routine
From MaRDI portal
Publication:4401563
DOI10.1145/360980.361001zbMath0276.68025OpenAlexW2091453775MaRDI QIDQ4401563
John L. Selfridge, Marvin Wunderlich
Publication date: 1974
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/360980.361001
multiprecise integersnumber theory packagetrial division routineunique factorization of large integers
Packaged methods for numerical algorithms (65Y15) Factorization (11Y05) Algorithms in computer science (68W99)
Related Items (11)
The Most Frequent Values of the Largest Prime Divisor Function ⋮ An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\) ⋮ The median largest prime factor ⋮ A monte carlo method for factorization ⋮ On the largest prime factor of an integer ⋮ Some remarks concerning the M.I.T. public-key cryptosystem ⋮ Analysis of a simple factorization algorithm ⋮ An improved Monte Carlo factorization algorithm ⋮ An improved parallel block Lanczos algorithm over GF(2) for integer factorization ⋮ Factoring on a computer ⋮ An Overview of Factoring
This page was built for publication: A design for a number theory package with an optimized trial division routine
