itscomputers / pollard-rho-prime-factorization

projects implementing the Pollard rho method in order to factor integers into their prime constituents.
GNU General Public License v3.0
1 stars 1 forks source link

question #1

Open OSoup opened 5 years ago

OSoup commented 5 years ago

Hello,

Can we apply this to bitcoin private keys if we know x and y values from public key? Thanks!

itscomputers commented 4 years ago

this is some of the first code i ever wrote, so i wouldn't trust it to do anything and certainly not to do anything quickly. i was just trying to feel out different languages. i'm sure the code is very bad in all of the languages here.

also, in practice pollard's rho method is slow at factoring numbers that are two very big primes multiplied together. however, feel free to use or modify the code here.