|
|
|
|
|
|
by scottlocklin
2469 days ago
|
|
|
Even the first line of that paper is false. "RSA cryptography is based on the difficulty of factoring large integers, which is an NP-hard (and hence intractable) problem for a classical computer." That is incorrect: there is no proof that factoring is NP-hard. Anyway, you can hardly expect me to take anything they say after this seriously. |
|
|
I just... I can't.