Prime numbers and computer methods for factorization.

zbMATH Open0821.11001MaRDI QIDQ1897680FDOQ1897680

Authors: Hans Riesel 

Publication date: 7 September 1995

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

Recommendations

• Prime numbers and computer methods for factorization
• Prime numbers and computer methods for factorization
• Publication:3030878
• scientific article; zbMATH DE number 2206373
• scientific article; zbMATH DE number 1259076
• scientific article; zbMATH DE number 2066372
• Primality tests and factorization algorithms. I

zbMATH Keywords

tablesalgorithmscryptographyRiemann zeta-functionprimality testsdistribution of prime numbersprimes in arithmetic progressionscomputational number theorynumber field sievegaps between primesprime counting functionfactorization methodsPASCALelliptic curve methodtable of prime factors of Fermat numbers

Mathematics Subject Classification ID

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

Cited In (57)

• Smooth subsum search a heuristic for practical integer factorization
• Title not available (Why is that?)
• Applying evolutionary algorithm to public key cryptosystems
• The impact of \(\zeta(s)\) complex zeros on \(\pi(x)\) for \(x<10^{10^{13}}\)
• Fermat Numbers and Mersenne Numbers
• Title not available (Why is that?)
• Primitive prime divisors of orders of Suzuki-Ree groups
• Three new factors of Fermat numbers
• Title not available (Why is that?)
• Lucas atoms
• Theoretical frame properties of wave-packet matrices over prime fields
• On the primes with \(p_{n+1}-p_n=8\) and the sum of their reciprocals
• Title not available (Why is that?)
• Large-order multiple recursive generators with modulus \(2^{31}-1\)
• The twenty-fourth Fermat number is composite
• Verifying the Goldbach conjecture up to \(4\cdot 10^{14}\)
• On the several differences between primes
• Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus
• Generalized wavelet transforms over finite fields
• Efficient computer search of large-order multiple recursive pseudo-random number generators
• Recent developments in primality proving
• On pseudoprimes having special forms and a solution of K. Szymiczek's problem
• Factorization of the tenth Fermat number
• Factorization of the Eighth Fermat Number
• A role for generalized Fermat numbers
• New Factors of Fermat Numbers
• Title not available (Why is that?)
• Computational strategies for the Riemann zeta function
• A time-space tradeoff for Lehman's deterministic integer factorization method
• A constructive approach to the finite wavelet frames over prime fields
• Square form factorization
• New maximal prime gaps and first occurrences
• Table errata 2 to ``Factors of generalized Fermat numbers
• SEMI TWIN PRIME NUMBERS
• Half-factorial domains and quadratic orders
• A babystep-giantstep method for faster deterministic integer factorization
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• Title not available (Why is that?)
• The Twentieth Fermat Number is Composite
• Some Factors of the Numbers G n = 6 2 n + 1 and H n = 10 2 n + 1
• Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
• Primes of the form 2p+1
• The sixth Fermat number and palindromic continued fractions
• Classical wavelet transforms over finite fields
• Interview with Bruce Sagan
• A reduction of integer factorization to modular tetration
• Two algorithms to find primes in patterns
• Dense admissible sequences
• Estimates of \(\psi\), \(\theta\) for large values of \(x\) without the Riemann hypothesis
• The Twenty-Second Fermat Number is Composite
• Wave packet transforms over finite cyclic groups
• 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
• Integer sequences with regularly varying counting functions have power-law variance functions
• New fast methods to compute the number of primes smaller than a given value
• A note on factors of generalized Fermat numbers

This page was built for publication: Prime numbers and computer methods for factorization.

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