A tale of two sieves.

MaRDI QIDQ2769072zbMATH OpenFDO

Authors Carl Pomerance

Publication date 4 February 2002

Published in Notices of the American Mathematical Society (Search for Journal in Brave)

Mathematics Subject Classification ID

Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Continued fraction calculations (number-theoretic aspects) (11Y65)

Cited in

(19)

• Ternary arithmetic, factorization, and the class number one problem
• The factorisation of \(2^{67}-1\)
• Topics in Cryptology – CT-RSA 2004
• Fermat's method of factorisation
• The sharp threshold for making squares
• Higher-dimensional sieving for the number field sieve algorithms
• Product representations of polynomials
• Infinitude of primes: Euclid's proof using angles between lattice vectors
• Parallel structured Gaussian elimination for the number field sieve
• Rigorous analysis of a randomised number field sieve
• Factorization of the tenth Fermat number
• Computation of orders and cycle lengths of automorphisms of finite solvable groups
• A problem of Erdős–Graham–Granville–Selfridge on integral points on hyperelliptic curves
• scientific article; zbMATH DE number 1996336 (Why is no real title available?)
• Computation of a 768-bit prime field discrete logarithm
• New upper bounds for the Davenport and for the Erdős-Ginzburg-Ziv constants
• Cognitive and computational complexity: considerations from mathematical problem solving
• Smooth subsum search a heuristic for practical integer factorization
• Parity check matrices and product representations of squares

This page was built for publication: A tale of two sieves.

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