3 ms·
What about quantum computation? My (only slightly informed) understanding is that quantum computing's greatest strength lines up perfectly with the problem of b
by jjoonathan 13y ago
What about quantum computation? My (only slightly informed) understanding is that quantum computing's greatest strength lines up perfectly with the problem of brute-forcing encryption.
- tptacek 13y agoQuantum computing is a threat to RSA, DH, DSA, EDH, and ECDSA, but not to AES.
- Dylan16807 13y agoThe question then becomes how you're going to establish an AES key across a public channel without using quantum-vulnerable algorithms.
- tptacek 13y agoPresumably, you swap RSA for a code-based cryptosystem; the TLS structure itself could probably remain intact.
- quotemstr 13y agoWhat does a "code-based cryptosystem" mean? You can approximate asymmetric cryptography using something like Kerberos, but these schemes requires a trusted third party.
- tptacek 13y agoYou seem to be under the misapprehension that quantum computing threatens all asymmetric cryptosystems. It doesn't. McElice is an example of an asymmetric scheme that uses binary error correcting codes as its trapdoor function, rather than discrete logs.
- betterunix 13y agohttps://en.wikipedia.org/wiki/Post-quantum_cryptography https://en.wikipedia.org/wiki/Post-quantum_cryptography
- bascule 13y agoMcBits is a public key encryption algorithm which should be resistant to attacks by quantum computers: http://binary.cr.yp.to/mcbits.html http://binary.cr.yp.to/mcbits.html
- juhanima 13y agoAES is not unbreakable, just very hard to break. Schneier in 2009: http://www.schneier.com/blog/archives/2009/07/another_new_aes.html http://www.schneier.com/blog/archives/2009/07/another_new_ae...
- tptacek 13y agoI didn't say AES was "unbreakable"; that's a meaningless term. I said it wasn't threatened by quantum computing.
- jjoonathan 13y agoGrover's algorithm halves the keysize. It's not a theoretical problem (just double the keysize) but plenty of sites today use 128-bit keys for their block ciphers. Even though quantum computers don't rival classical computers for speed yet and therefore saying that these keys are "effectively 64-bit" would be slightly disingenuous, there's no reason to expect that QCs won't make that a reality within our lifetimes.
- bascule 13y agoA sufficiently patient attacker can still eavesdrop on TLS sessions established via RSA or ECDHE today, wait for quantum computers to arrive (10+ years?), then break their public keys, and derive the symmetric keys used to encrypt the session from there.