399
Mathematician warns NSA may be weakening next-gen encryption
(www.newscientist.com)
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
this post was submitted on 19 Oct 2023
399 points (97.2% liked)
Technology
59312 readers
4599 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
I think you vastly underestimate modern encryption. I would recommend looking up concepts and math from encryption, it makes more sense for why thinking that practically unbreakable encryption is very much possible once you do.
It's why governments want to implement back-doors, because they are not actually capable of breaking it more directly.
Did you not read the article? It has nothing to do with backdoors.
....it's literally about accusing NSA of trying to implement back-doors for quantum resistant encryption.
I have no idea what you're trying to get at.
NIST is giving incorrect information. That will not enable back doors. And it is only a matter of time before that doesn't matter. I have no idea why you think there is such a thing as an unbreakable code that is not a one-time use code.
Edit: ACCUSED of giving incorrect information.
I have no idea why you think there isn't. Maybe you're going off a strange definition of "unbreakable". When it's used in cryptography, it means "unbreakable in reasonable time limits" (e.g. millions of years).
The thing about good encryption is that it's not just hard to break, it's mathematically too hard to break even if your available computing power keeps rising exponentially. Unless there is a mistake in the algorithm, it is for all intents and purposes, unbreakable.
There are theoretical limits to the speed of computation. One limit is the minimum amount of energy it takes to flip a bit. For 256-bit encryption, you have to start saying things like "assume we can convert 100% of the energy from a supernova into a theoretically perfect computer with perfect efficiency". This is a round about way of saying "impossible".
We've been hammering AES and RSA for decades now, and we haven't been able to get significantly better than brute force against either one. Quantum computers will break RSA (if they can be made with enough qbits, but might be infeasible), but worst case scenario for AES is that we double the key length and we're good again.