securekomodo:~#

hacker of things

Factoring Prime numbers with Java

This was an assignment from a cryptography class during my undergrad. This mainly assisted in decrypting a low-bit RSA algorithm but can be used for any purpose.

Essentially it will loop through and perform some mod calculations to figure out the prime factors in the specified range. The three algoritems are used to show that even if a number doesn’t seem to be prime at first, it could be a prime number used in an encryption algorithm.

Feel free to judge… I do not claim to be a Java Dev of any type. (nor want to be…)