A Method of Factoring and the Factorization of F 7
From MaRDI portal
Cited in
(38)- Reading Gauss in the computer age: On the U.S. Reception of Gauss's number theoretical work (1938-1989)
- On the distribution in short intervals of integers having no large prime factor
- Modern factorization methods
- Reductions among number theoretic problems
- Recent developments in primality testing
- The influence of computers in the development of number theory
- Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel
- Enhancement of coping through blurring
- Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms
- Sequences of numbers generated by addition in formal groups and new primality and factorization tests
- Factoring with hints
- Post-quantum cryptography: state of the art
- The Factorization of the Ninth Fermat Number
- Cryptanalysis of RSA Using the Ratio of the Primes
- Tables of Fibonacci and Lucas factorizations
- Some remarks concerning the M.I.T. public-key cryptosystem
- An improved Monte Carlo factorization algorithm
- Factorization of the Eighth Fermat Number
- Two New Factors of Fermat Numbers
- A monte carlo method for factorization
- Factorization of the tenth Fermat number
- New applications of the polynomial method: the cap set conjecture and beyond
- New Cullen Primes
- An overview of factoring
- New ideas for factoring large integers
- Factoring Numbers on the Massively Parallel Computer
- Factorization using the quadratic sieve algorithm
- Signatures through approximate representations by quadratic forms
- Why does a prime \(p\) divide a Fermat number?
- Root optimization of polynomials in the number field sieve
- Square form factorization
- Factoring: algorithms, computations, and computers
- A parallel version of the continued fraction integer factoring algorithm
- Smooth subsum search a heuristic for practical integer factorization
- Parallel structured Gaussian elimination for the number field sieve
- Factoring on a computer
- On the solution of \(x^2-dy^2=\pm m\).
- Some uses of microcomputers in number theory research
This page was built for publication: A Method of Factoring and the Factorization of F 7
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4055708)
