4 ms·
It is fair to say, that in security assessment you estimate lower bound on complexity of hacking. Schor proved upper bound.
by miga 4y ago
It is fair to say, that in security assessment you estimate lower bound on complexity of hacking.
Schor proved upper bound.
- px43 4y agoThere are two cryptographers being discussed here. Peter Shor, and (Claus) Peter Schnorr. Neither are Schor.
- rezonant 4y agoShor, Schnorr, Schor and Schneier.
- coolspot 4y agoThey all are the same person - Satoshi.
- monktastic1 4y agoYou mean Schnatoshi?