Modern factorization methods

DOI10.1007/BF01934998zbMATH Open0607.10005OpenAlexW4247512137MaRDI QIDQ1085192FDOQ1085192

Authors: Hans Riesel 

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934998

Recommendations

• scientific article; zbMATH DE number 3950601
• scientific article; zbMATH DE number 1696618
• scientific article; zbMATH DE number 4045819
• Asymptotically Fast Factorization of Integers
• scientific article; zbMATH DE number 1024054

zbMATH Keywords

computational number theoryexpository paperfactorization of large integersPollard's p-1-method

Mathematics Subject Classification ID

Primes (11A41) 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?)
• A monte carlo method for factorization
• Analysis of a simple factorization algorithm
• Prime numbers and computer methods for factorization
• An improved Monte Carlo factorization algorithm
• A Method of Factoring and the Factorization of F 7
• A p + 1 Method of Factoring

Cited In (6)

• Title not available (Why is that?)
• History of integer factorisation
• Mathematical problems in cryptology
• Title not available (Why is that?)
• An overview of factoring
• Factoring large numbers

Uses Software

• CFRAC

This page was built for publication: Modern factorization methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085192)