![]() |
Whats your hardest factoring problem?
I was wondering what the hardest factoring problem you have come across. I will post a few difficult ones i have come across tommorrow. Lets see some tough factoring.
|
How about finding prime factorizations for 128-bit numbers? That's a tough one, and would render RSA security nearly worthless if you find a way to do it quickly.
|
| All times are GMT -5. The time now is 04:15. |
Powered by vBulletin® Version 3.6.4
Copyright ©2000 - 2017, Jelsoft Enterprises Ltd.
Copyright © Chief Delphi