The following pages link to The joy of factoring (Q2863722):
Displaying 13 items.
- Quantum algorithms for typical hard problems: a perspective of cryptanalysis (Q2677252) (← links)
- Integer factorization as subset-sum problem (Q2700674) (← links)
- Factoring integers (Q2721282) (← links)
- A babystep-giantstep method for faster deterministic integer factorization (Q3177725) (← links)
- Factorization and primality testing (Q3995106) (← links)
- New applications of the polynomial method: The cap set conjecture and beyond (Q4562036) (← links)
- A time-space tradeoff for Lehman’s deterministic integer factorization method (Q4992239) (← links)
- A log-log speedup for exponent one-fifth deterministic integer factorisation (Q5070544) (← links)
- A Reduction of Integer Factorization to Modular Tetration (Q5859627) (← links)
- Computers as a novel mathematical reality. III: Mersenne numbers and sums of divisors (Q6148160) (← links)
- Pseudoprimes and Fermat numbers (Q6542781) (← links)
- Ramanujan's taxicab number and its ilk (Q6579275) (← links)
- Smooth subsum search a heuristic for practical integer factorization (Q6660954) (← links)