The following pages link to A tale of two sieves. (Q2769072):
Displaying 18 items.
- New upper bounds for the Davenport and for the Erdős-Ginzburg-Ziv constants (Q766082) (← links)
- Product representations of polynomials (Q850085) (← links)
- Parity check matrices and product representations of squares (Q949791) (← links)
- The sharp threshold for making squares (Q1643387) (← links)
- Rigorous analysis of a randomised number field sieve (Q1747213) (← links)
- Infinitude of primes: Euclid's proof using angles between lattice vectors (Q2036227) (← links)
- Computation of orders and cycle lengths of automorphisms of finite solvable groups (Q2048160) (← links)
- Factorization of the tenth Fermat number (Q4221993) (← links)
- (Q4432309) (← links)
- Ternary arithmetic, factorization, and the class number one problem (Q5090223) (← links)
- Fermat's method of factorisation (Q5364981) (← links)
- The factorisation of 2<sup>67</sup> − 1 (Q5364982) (← links)
- Computation of a 768-Bit Prime Field Discrete Logarithm (Q5738876) (← links)
- Topics in Cryptology – CT-RSA 2004 (Q5901701) (← links)
- Higher-dimensional sieving for the number field sieve algorithms (Q6165871) (← links)
- A problem of Erdős–Graham–Granville–Selfridge on integral points on hyperelliptic curves (Q6198124) (← links)
- Cognitive and computational complexity: considerations from mathematical problem solving (Q6652877) (← links)
- Smooth subsum search a heuristic for practical integer factorization (Q6660954) (← links)
