1
edit
Changes
no edit summary
<u>'''Rene's Findings'''</u>
I decided to pursue an old project of mine RSA factorizerfactorization. The old version was a simple brute force attack which I initially planned to parallelize because of the nature of this algorithm(Try every possible value starting from
(1-->N). What changed my mind was that this brute force process was already reasonable for small prime numbers and would not see any noticeable gain, vs better algorithms, from this prallelization.