138
Physicists May Have Found a Hard Limit on The Performance of Large Quantum Computers
(www.sciencealert.com)
this post was submitted on 04 Dec 2023
138 points (97.9% liked)
Technology
58131 readers
5339 users here now
This is a most excellent place for technology news and articles.
Our Rules
- Follow the lemmy.world rules.
- Only tech related content.
- Be excellent to each another!
- Mod approved content bots can post up to 10 articles per day.
- Threads asking for personal tech support may be deleted.
- Politics threads may be removed.
- No memes allowed as posts, OK to post as comments.
- Only approved bots from the list below, to ask if your bot can be added please contact us.
- Check for duplicates before posting, duplicates may be removed
Approved Bots
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Why not? I've got a hard drive which I lost the keys to I'd like to recover, and having all the old secrets out in the open would be really interesting.
It isn't expected that a quantum computer will be able to instantly break symmetric encryption, as is used in full disk encryption. It will give an enormous advantage (halving the number of bits of security) but attacking that will still require a large amount of time and energy. What a CRQC will very quickly break is the asymmetric primitives, as used in TLS, encrypted email and chats, etc.
On the other hand, using default parameters from not so long ago, it is cheaper than you might expect to brute-force your disk passphrase already today without a quantum computer... which is why you should use a stronger key derivation function (in addition to a strong passphrase, of course).
Isn't that symmetrical encryption? Quantum computers aren't really that beneficial for symmetrical encryption iirc, due to it being a process that can't be parallelized very efficiently (and quantum computers are kinda slow per operation).