4 ms·
Pedant: Fortunately SHA256 and ECDSA are proven to be quantum proof, so we'll need some massive new discovery in the field of computation to hope to break these
by SavantIdiot 5y ago
Pedant: Fortunately SHA256 and ECDSA are proven to be quantum proof, so we'll need some massive new discovery in the field of computation to hope to break these. Probably easier just to hack the keys out of the wallets via rubber hose method.
- legutierr 5y agoHashing algorithms like SHA256 are probably quantum safe, but Elliptic Curve Digital Signatures are not! "Imagine that it's fifteen years from now. Somebody announces that he's built a large quantum computer. RSA is dead. DSA is dead. Elliptic curves, hyperelliptic curves, class groups, whatever, dead, dead, dead." https://pqcrypto.org/ https://pqcrypto.org/
- SavantIdiot 5y agoWell I was waaaaay off. Damn, wish I could edit my misinformed post. For some reason I thought bitcoin picked both of those for their blockchain b/c they were Q-proof.
- gizmo686 5y agoWe haven't even proven SHA256 and ECDSA are secure on classical computers. As far as we can tell, they are no less secure on quantum computers. However on both classical and quantum computers, their security is still just "we haven't thought of any way to break them", and not "we have a proof that they cannot be broken under <insert model of computation>".
- acchow 5y ago> However on both classical and quantum computers, their security is still just "we haven't thought of any way to break them", and not "we have a proof that they cannot be broken under <insert model of computation>". Hmm, it's slightly different. There is an algorithm to break ECDSA on quantum computers. We have the algorithm, but we don't know how to build the quantum computer yet.