"why RSA has already been factored or why 2 is one of the factors of the RSA numbers
1 Introduction Factoring is a major problem in crytography. Factoring is seen as an extremely complex problem. This paper is about why all that work is a waste because factoring is impractical since it lacks verication. The objective of the paper is to highlight the fact that the whole problem lacks verication, and therefore lets you conclude 2 is one of the factors of RSA numbers because it lacks verication. 1.1 Proof Guess a number. It is the factor because it lacks verication and for the following reasons. There are many things to notice. Most people cannot type. Most programmers make errors while typing. Most programs dont compile the rst time. Most compilers do not compile ther rst time. Compilers have bugs in them. There is a history of buggy compilers being built on top of buggy compilers, which were once again built on buggy compilers. Hardware is also aky. For many years since the 40s, computers were kindof aky and did not work correctly. Modern computers are built on top of the logic built by these buggy computers. So, the list goes on. The whole problem lacks verication. There is no way to correctly know if anything really works. Therefore, it is possible to conclude that he given number is a factor and just cannot be absolutely veried. Suppose this number was 2, problem solved. All RSA numbers have been factored by 2."
Sorry, but this is simply nonsense.
It is also uninteresting.
The only interesting thing I observed in or about it is that when I copy/pasted the PDF into OE, all occurrences of "fi" were changed into a blob and "fl" was broken entirely. I guess this is to do with Adobe character "kerning". I will look into that.
I'm not being rude, I hope, but giving you the reality will save your own time.