A Summation-Based Algorithm For Integer Factorization
By: Justin Friedlander
Potential Business Impact:
Breaks secret codes by finding number parts.
Numerous methods have been considered to create a fast integer factorization algorithm. Despite its apparent simplicity, the difficulty to find such an algorithm plays a crucial role in modern cryptography, notably, in the security of RSA encryption. Some approaches to factoring integers quickly include the Trial Division method, Pollard's Rho and p-1 methods, and various Sieve algorithms. This paper introduces a new method that converts an integer into a sum in base-2. By combining a base-10 and base-2 representation of the integer, an algorithm on the order of $\sqrt{n}$ time complexity can convert that sum to a product of two integers, thus factoring the original number.
Similar Papers
Decomposition of RSA modulus applying even order elliptic curves
Cryptography and Security
Breaks secret codes by finding hidden number parts.
A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
Data Structures and Algorithms
Makes computers factor numbers much faster.
Quantum Prime Factorization: A Novel Approach Based on Fermat Method
Cryptography and Security
Breaks secret codes much faster using quantum computers.