Prime numbers and computer methods for factorization.

zbMath0821.11001MaRDI QIDQ1897680

Hans Riesel

Publication date: 7 September 1995

Published in: Progress in Mathematics (Search for Journal in Brave)

zbMATH Keywords

tablesalgorithmscryptographyRiemann zeta-functionprimes in arithmetic progressionsprimality testsdistribution of prime numberscomputational number theorynumber field sievegaps between primeselliptic curve methodfactorization methodsPASCALprime counting functiontable of prime factors of Fermat numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Software, source code, etc. for problems pertaining to number theory (11-04) Distribution of primes (11N05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization; primality (11A51) Primes (11A41) Factorization (11Y05) Primality (11Y11) Computational number theory (11Yxx)

Related Items

SEMI TWIN PRIME NUMBERS ⋮ Interview with Bruce Sagan ⋮ A babystep-giantstep method for faster deterministic integer factorization ⋮ The twenty-fourth Fermat number is composite ⋮ On the primes with \(p_{n+1}-p_n=8\) and the sum of their reciprocals ⋮ A log-log speedup for exponent one-fifth deterministic integer factorisation ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ Unnamed Item ⋮ Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus ⋮ New fast methods to compute the number of primes smaller than a given value ⋮ Wave packet transforms over finite cyclic groups ⋮ A role for generalized Fermat numbers ⋮ Primitive prime divisors of orders of Suzuki-Ree groups ⋮ Efficient computer search of large-order multiple recursive pseudo-random number generators ⋮ Theoretical frame properties of wave-packet matrices over prime fields ⋮ Generalized wavelet transforms over finite fields ⋮ Integer factorization as subset-sum problem ⋮ On the several differences between primes ⋮ Dense admissible sequences ⋮ Verifying the Goldbach conjecture up to 4⋅10¹⁴ ⋮ Table errata 2 to “Factors of generalized Fermat numbers” ⋮ Lucas atoms ⋮ Square form factorization ⋮ Half-factorial domains and quadratic orders ⋮ Estimates of $\psi ,\theta $ for large values of $x$ without the Riemann hypothesis ⋮ ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation ⋮ A constructive approach to the finite wavelet frames over prime fields ⋮ Two algorithms to find primes in patterns ⋮ Large-Order Multiple Recursive Generators with Modulus 2³¹ − 1 ⋮ Applying evolutionary algorithm to public key cryptosystems ⋮ The impact of 𝜁(𝑠) complex zeros on 𝜋(𝑥) for 𝑥<10^{10¹³} ⋮ A time-space tradeoff for Lehman’s deterministic integer factorization method ⋮ Unnamed Item ⋮ Recent developments in primality proving ⋮ A note on factors of generalized Fermat numbers ⋮ Computational strategies for the Riemann zeta function ⋮ Factorization of the tenth Fermat number ⋮ A Reduction of Integer Factorization to Modular Tetration ⋮ Primes of the form 2p+1 ⋮ New maximal prime gaps and first occurrences