Hi everyone Please Register or Log in to view the hidden image! I was recently working on a project that involved RSA (I am a freelance programmer/server managment specialist) and just to get the feel for the algorithm I was working with, I produced several 'sets' of numbers for utilization in the algorithm. First of all, I noticed the cyclic problem (which I later found heavily documented in a paper online somewhere), which was quite interesting. Secondly, I started thinking of ways to possibly get around the product of the two primes. Obviously, I know that there is no way to do this (under normal conditions with just given that modulus[N]) within polynomial time, but I began to take that N I got, and plug it in as a new Q or P and generate another set and look at the patterns between there. It seems like it'd be possible to look at the relations between the sets of numbers (or n set of numbers, not just 2) in order to possibly get the original P and Q. I probably sound way off my rocker, and exploits for RSA aren't generally discussed anywhere because it's such a (beleived) secure cryptosystem, but I am wondering if anyone else has looked into this and what conclusions they may have drawn.
