I stated in my previous post that the traveling salesman problem with distances a and b is easy. A consequence is factoring is also easy. Large numbers such as RSA numbers can be easily factored. I use the algorithm for the traveling salesman problem to factorize the RSA numbers that haven’t been factored yet, 31 numbers ranging from 260 to 617 digits. I’ll provide next more information and details.

Author: Fouad El Khamlichi

Computer Science View all posts by Fouad El Khamlichi