Prime numbers and computer methods for factorization.
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
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)
- 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
- New fast methods to compute the number of primes smaller than a given value
- Applying evolutionary algorithm to public key cryptosystems
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- The impact of \(\zeta(s)\) complex zeros on \(\pi(x)\) for \(x<10^{10^{13}}\)
- scientific article; zbMATH DE number 14712 (Why is no real title available?)
- Fermat Numbers and Mersenne Numbers
- Primitive prime divisors of orders of Suzuki-Ree groups
- Three new factors of Fermat numbers
- scientific article; zbMATH DE number 3448642 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 107574 (Why is no real title available?)
- 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
- Efficient computer search of large-order multiple recursive pseudo-random number generators
- Recent developments in primality proving
- Generalized wavelet transforms over finite fields
- On pseudoprimes having special forms and a solution of K. Szymiczek's problem
- A role for generalized Fermat numbers
- Factorization of the tenth Fermat number
- Factorization of the Eighth Fermat Number
- New Factors of Fermat Numbers
- scientific article; zbMATH DE number 4019141 (Why is no real title available?)
- Computational strategies for the Riemann zeta function
- A constructive approach to the finite wavelet frames over prime fields
- A time-space tradeoff for Lehman's deterministic integer factorization method
- Table errata 2 to ``Factors of generalized Fermat numbers
- Square form factorization
- New maximal prime gaps and first occurrences
- SEMI TWIN PRIME NUMBERS
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
- Half-factorial domains and quadratic orders
- A babystep-giantstep method for faster deterministic integer factorization
- scientific article; zbMATH DE number 3475516 (Why is no real title available?)
- The Twentieth Fermat Number is Composite
- Some Factors of the Numbers G n = 6 2 n + 1 and H n = 10 2 n + 1
- The sixth Fermat number and palindromic continued fractions
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Primes of the form 2p+1
- Classical wavelet transforms over finite fields
- Interview with Bruce Sagan
- A reduction of integer factorization to modular tetration
- Smooth subsum search a heuristic for practical integer factorization
- Two algorithms to find primes in patterns
- Dense admissible sequences
- Estimates of \(\psi\), \(\theta\) for large values of \(x\) without the Riemann hypothesis
- Wave packet transforms over finite cyclic groups
- The Twenty-Second Fermat Number is Composite
- Integer factorization as subset-sum problem
- New applications of the polynomial method: the cap set conjecture and beyond
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- A note on factors of generalized Fermat numbers
- Integer sequences with regularly varying counting functions have power-law variance functions
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)
