A Computational Approach to Factoring Large Integers

TL;DR

This paper presents a computational method for factoring large integers by designing an optimal database of test values, simplifying the process of identifying prime factors.

Contribution

It introduces a novel approach that reduces integer factorization to selecting optimal test values, improving efficiency over previous methods.

Findings

Proposes a database-based factorization method

Simplifies the factorization process for large integers

Potentially enhances computational efficiency

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.