Another one of my dumb ideas. I am in a cryptography class, just trying to figure out how this one way function works and find if there are any attacks against the modulus. If you know any modulus attacks please share.
This idea isn’t tested but I am just trying to learn why these one way functions such as RSA are computational difficult. I now even computers have trouble factoring large digits of 64-digits or more. But maybe RSA weakness is in the modulus operation.
Say we have “P” the product of 2 Prime numbers which are so large they are unknown. Could we take a larger number than P and call this large number “L”. We search to find all numbers where P mod L = 0. But we do not have to search all numbers because we know where L = 0 is a multiple of P. So you have P^2 ; P^3 ; P^4…P^n .
Now what? This is where the computer comes in to test the fraction made by
P / larger number
15 is the multiple of the two smallest Prime numbers: 3 and 5.
15 / 30 = ½
15 / 45 = 1/3
15 * 1/3 = 5
We test to see if 5 is Prime then we know 15 = 3 * 5.
This is untested for all numbers and probably doesn’t work. It just helps me understand the one way function and public key cryptography. I still need to do more analysis, but this idea may have already been tried before. I am ignorant of the attacks on RSA.
20110506---Bobby Joe Snyder