A Computational Approach to Factoring Large Integers
classification
🧮 math.GM
keywords
approachintegerproblembasecertaincomputationaldatadesigning
read the original abstract
To factor an integer N, given that it is equal to the product of two primes, it suffices to find an integer d satisfying a certain simple numerical test. In this approach, the factorization problem equates to the problem of designing an optimal data base of values d to be tested.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.