A Method of Factoring and the Factorization of F 7
From MaRDI portal
Publication:4055708
DOI10.2307/2005475zbMath0302.10010OpenAlexW4245046265WikidataQ22305567 ScholiaQ22305567MaRDI QIDQ4055708
John Brillhart, Michael A. Morrison
Publication date: 1975
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2005475
Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Factorization (11Y05)
Related Items
On the solution of \(x^2-dy^2=\pm m\)., On the distribution in short intervals of integers having no large prime factor, Modern factorization methods, Reductions among number theoretic problems, New applications of the polynomial method: The cap set conjecture and beyond, Tables of Fibonacci and Lucas factorizations, Factorization of the Eighth Fermat Number, Some uses of microcomputers in number theory research, Recent developments in primality testing, The influence of computers in the development of number theory, A monte carlo method for factorization, Comparison of the efficiency of the factoring algorithms of Morrison-Brillhart and Schroeppel, Why Does a Prime p Divide a Fermat Number?, Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms, The Factorization of the Ninth Fermat Number, Factoring: algorithms, computations, and computers, A parallel version of the continued fraction integer factoring algorithm, Some remarks concerning the M.I.T. public-key cryptosystem, Square form factorization, Factoring with hints, New Cullen Primes, An improved Monte Carlo factorization algorithm, Post-Quantum Cryptography: State of the Art, Enhancement of coping through blurring, Two New Factors of Fermat Numbers, Cryptanalysis of RSA Using the Ratio of the Primes, Sequences of numbers generated by addition in formal groups and new primality and factorization tests, Reading Gauss in the computer age: On the U.S. Reception of Gauss's number theoretical work (1938-1989), Factorization of the tenth Fermat number, Factoring on a computer, 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, Root optimization of polynomials in the number field sieve
Uses Software
