The joy of factoring
From MaRDI portal
Publication:2863722
Recommendations
Cited in
(18)- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
- Integer algorithms in cryptology and information assurance
- Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky
- A reduction of integer factorization to modular tetration
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Ramanujan's taxicab number and its ilk
- Factoring integers
- A babystep-giantstep method for faster deterministic integer factorization
- A time-space tradeoff for Lehman's deterministic integer factorization method
- History of integer factorisation
- Pseudoprimes and Fermat numbers
- A quantum version of Pollard's Rho of which Shor's algorithm is a particular case
- scientific article; zbMATH DE number 2123741 (Why is no real title available?)
- Integer factorization as subset-sum problem
- Prime factorization without using any approximations
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- New applications of the polynomial method: the cap set conjecture and beyond
- Smooth subsum search a heuristic for practical integer factorization
This page was built for publication: The joy of factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863722)