A design for a number theory package with an optimized trial division routine

DOI10.1145/360980.361001MaRDI QIDQ4401563zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

multiprecise integersnumber theory packagetrial division routineunique factorization of large integers

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15) Factorization (11Y05) Algorithms in computer science (68W99)

Recommendations

• A multiprecise integer arithmetic package
• scientific article; zbMATH DE number 3341170
• scientific article; zbMATH DE number 1931193
• A deterministic algorithm for integer factorization
• scientific article; zbMATH DE number 3475515

Cited in

(14)

• A monte carlo method for factorization
• The median largest prime factor
• scientific article; zbMATH DE number 3341170 (Why is no real title available?)
• 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)
• scientific article; zbMATH DE number 2160562 (Why is no real title available?)
• 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

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)