- cross-posted to:
- futurology
- technology@lemmy.world
- cross-posted to:
- futurology
- technology@lemmy.world
Mathematician warns NSA may be weakening next-gen encryption::Quantum computers may soon be able to crack encryption methods in use today, so plans are already under way to replace them with new, secure algorithms. Now it seems the US National Security Agency may be undermining that process
There is no such thing as unbreakable encryption. If you want to hide a message, hide it at the source with the way you phrase things. I still have to buy weed illegally, and I use Signal, but I don’t tell the person I buy it from, “hey, I want a half-ounce of weed and I’ll pick it up on Friday at 2 pm,” I say something like, “hey, are you free this weekend?” And then they’ll say something like, “yeah, do you want to get your usual thing?” and then we’ll arrange a time.
And yes, I see the irony about talking about buying weed illegally when someone could potentially find out who I am on Lemmy.
…there very much is practically unbreakable encryption. We use those every day (it’s part of the s in https).
And your example is just a very rudimentary form of encryption that is far far weaker than the typical encryption methods used on the internet today.
It’s unbreakable until it isn’t.
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.
Defi crypto users didn’t like that.
True encryption does exist, it’s just that the encryption key is equally as long as the message itself which shows how impractical it is: if you have a method secure enough to send an encryption key of length X, why not just send the actual message of length X?
That’s interesting. I’ve never heard that before. Do you have more information I can read about somewhere?
https://en.m.wikipedia.org/wiki/One-time_pad
Is that what they’re talking about?
Yes
But one-time pads aren’t impractical like they said?
One-time pads are impractical because the sender and the target need to meet up beforehand and agree on a code, and no one else should know this code. With modern encryption, this is not necessary. The target can come up with both the encryption and decryption algorithms, and send only the first to the sender publicly.