Prime numbers and computer methods for factorization.
algorithmscomputational number theorycryptographydistribution of prime numberselliptic curve methodfactorization methodsgaps between primesnumber field sievePASCALprimality testsprime counting functionprimes in arithmetic progressionsRiemann zeta-functiontable of prime factors of Fermat numberstables
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Factorization; primality (11A51) Distribution of primes (11N05) Factorization (11Y05) Primality (11Y11) Number-theoretic algorithms; complexity (11Y16) Computational number theory (11Yxx) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)
Here is an outstanding technical monograph on recursive number theory and its numerous automated techniques. It successfully passes a critical milestone not allowed to many books, viz., a second edition. For a review of the first edition (1985) written by \textit{H. J. te Riele} see Zbl 0582.10001. Many good things have happened to computational number theory during the ten years since the first edition appeared and the author includes their highlights in great depth. Several major sections have been rewritten and totally new sections have been added. The new material includes advances on applications of the elliptic curve method, uses of the number field sieve, and two new appendices on the basics of higher algebraic number fields and elliptic curves. Further, the table of prime factors of Fermat numbers has been significantly up-dated; e.g., now it is known that \(F_ 9\) is tri-composite and \(F_{11}\) is penta-composite. Several other tables have been added so as to provide data to look for large prime factors of certain ``generalized Fermat numbers, while several other tables on special numbers were simply deleted in the second edition. Still one can make several perplexing assertions or challenges: (1) prove that \(F_ 5\), \(F_ 6\), \(F_ 7\), \(F_ 8\) are the only four consecutive Fermat numbers which are bi-composite; (2) Show that \(F_{14}\) is bi- composite. (This accounts for the difficulty in finding a prime factor for it.) (3) What is the smallest Fermat quadri-composite?; and (4) Does there exist a Fermat number with an arbitrarily prescribed number of prime factors? All in all, this handy volume continues to be an attractive combination of number-theoretic precision, practicality, and theory with a rich blend of computer science.
- 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
- Recent developments in primality proving
- The sixth Fermat number and palindromic continued fractions
- On the several differences between primes
- A note on factors of generalized Fermat numbers
- Computational strategies for the Riemann zeta function
- A constructive approach to the finite wavelet frames over prime fields
- Lucas atoms
- Integer factorization as subset-sum problem
- Dense admissible sequences
- Verifying the Goldbach conjecture up to \(4\cdot 10^{14}\)
- Half-factorial domains and quadratic orders
- Estimates of , for large values of x without the Riemann hypothesis
- Large-order multiple recursive generators with modulus \(2^{31}-1\)
- A role for generalized Fermat numbers
- Table errata 2 to ``Factors of generalized Fermat numbers
- scientific article; zbMATH DE number 4019141 (Why is no real title available?)
- The impact of \(\zeta(s)\) complex zeros on \(\pi(x)\) for \(x<10^{10^{13}}\)
- A babystep-giantstep method for faster deterministic integer factorization
- On pseudoprimes having special forms and a solution of K. Szymiczek's problem
- The Twentieth Fermat Number is Composite
- Factorization of the Eighth Fermat Number
- scientific article; zbMATH DE number 14712 (Why is no real title available?)
- scientific article; zbMATH DE number 107574 (Why is no real title available?)
- scientific article; zbMATH DE number 3475516 (Why is no real title available?)
- Efficient computer search of large-order multiple recursive pseudo-random number generators
- Factorization of the tenth Fermat number
- New maximal prime gaps and first occurrences
- New Factors of Fermat Numbers
- Applying evolutionary algorithm to public key cryptosystems
- New applications of the polynomial method: the cap set conjecture and beyond
- Theoretical frame properties of wave-packet matrices over prime fields
- Classical wavelet transforms over finite fields
- scientific article; zbMATH DE number 3448642 (Why is no real title available?)
- The twenty-fourth Fermat number is composite
- The Twenty-Second Fermat Number is Composite
- Three new factors of Fermat numbers
- Two algorithms to find primes in patterns
- A time-space tradeoff for Lehman's deterministic integer factorization method
- SEMI TWIN PRIME NUMBERS
- Interview with Bruce Sagan
- A \(\log\)-\(\log\) speedup for exponent one-fifth deterministic integer factorisation
- Generalized wavelet transforms over finite fields
- scientific article; zbMATH DE number 2206373 (Why is no real title available?)
- Square form factorization
- Some Factors of the Numbers G n = 6 2 n + 1 and H n = 10 2 n + 1
- Fermat Numbers and Mersenne Numbers
- A reduction of integer factorization to modular tetration
- Primes of the form 2p+1
- 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
- Primitive prime divisors of orders of Suzuki-Ree groups
- Integer sequences with regularly varying counting functions have power-law variance functions
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Smooth subsum search a heuristic for practical integer factorization
- Shifting Lucas sequences away from primes
- Matched column sets in repetend tables
- Gaps Between Consecutive Primes and the Exponential Distribution
- On the primes with \(p_{n+1}-p_n=8\) and the sum of their reciprocals
- Wave packet transforms over finite cyclic groups
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
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)
