The joy of factoring
From MaRDI portal
Publication:2863722
zbMATH Open1286.11001MaRDI QIDQ2863722FDOQ2863722
Authors: Samuel S. jun. Wagstaff 
Publication date: 3 December 2013
Published in: Student Mathematical Library (Search for Journal in Brave)
Recommendations
Continued fractions (11A55) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization (11Y05) Elliptic curves (14H52) Factorization; primality (11A51) Primality (11Y11) Sieves (11N35)
Cited In (18)
- Title not available (Why is that?)
- Factoring integers
- History of integer factorisation
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors
- Number-theoretic algorithms in cryptography. Transl. from the Russian by A. Martsinkovsky
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis
- Ramanujan's taxicab number and its ilk
- A quantum version of Pollard's Rho of which Shor's algorithm is a particular case
- Prime factorization without using any approximations
- A time-space tradeoff for Lehman's deterministic integer factorization method
- Integer algorithms in cryptology and information assurance
- A babystep-giantstep method for faster deterministic integer factorization
- A reduction of integer factorization to modular tetration
- Smooth subsum search a heuristic for practical integer factorization
- Pseudoprimes and Fermat numbers
- Integer factorization as subset-sum problem
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- New applications of the polynomial method: the cap set conjecture and beyond
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)
