A design for a number theory package with an optimized trial division routine
DOI10.1145/360980.361001zbMATH Open0276.68025OpenAlexW2091453775MaRDI QIDQ4401563FDOQ4401563
Authors: Marvin Wunderlich, John Selfridge 
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
Recommendations
multiprecise integersnumber theory packagetrial division routineunique factorization of large integers
Packaged methods for numerical algorithms (65Y15) Factorization (11Y05) Algorithms in computer science (68W99)
Cited In (14)
- The median largest prime factor
- Title not available (Why is that?)
- The Most Frequent Values of the Largest Prime Divisor Function
- A multiprecise integer arithmetic package
- Factoring on a computer
- Some remarks concerning the M.I.T. public-key cryptosystem
- An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\)
- Title not available (Why is that?)
- Analysis of a simple factorization algorithm
- An improved parallel block Lanczos algorithm over GF(2) for integer factorization
- An improved Monte Carlo factorization algorithm
- On the largest prime factor of an integer
- An overview of factoring
- A monte carlo method for factorization
This page was built for publication: A design for a number theory package with an optimized trial division routine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4401563)
