39 points

Quantum computers are nowhere near usable for breaking classical cryptography at the moment, though opinions on how soon it will come vary. As others have said, we have quantum resistant algorithms ready to go, so future encryption is fine.

The greater concern is that a lot of traffic and data encrypted using classical algorithms has been logged or stored in various mediums. An old encrypted drive, or communications stored by nation state actors (the NSA and such). These will be broken, and a lot of past secrets might come out from hiding.

permalink
report
reply
14 points

An old encrypted drive

All of these use ciphers that are only affected by Grover’s algorithm. This basically halves the exponent on your key space (so instead of 2^128 keys you only have 2^64 keys), however this doesn’t necessarily mean that the algorithm is faster than a good parallel brute force on classical computers.

The more problematic algorithms are the ones affected by Shor’s algorithm, which are all algorithms in broad use today that involve some sort of agreeing on a shared secret.

permalink
report
parent
reply
1 point

I’m not well versed on the speed of Grover’s over classical brute force. According to NIST this is correct! Thanks for the addition.

permalink
report
parent
reply
14 points
*

Meh… we used to use much weaker encryption algorithms, and kept upgrading those algorithms. This will just be another phase of making stronger encryption algorithms. AES-256 is already quantum resistant, we just need to work on a quantum resistant asymmetric system. Pretty sure we can get it done before a quantum computer with enough qbits is invented.

permalink
report
reply
9 points

This video by Veritasium was pretty insightful on the topic.

https://youtu.be/-UrdExQW0cs

But I guess we’ll have to see about “store now, decrypt later”…

permalink
report
reply
13 points

Here is an alternative Piped link(s): https://piped.video/-UrdExQW0cs

Piped is a privacy-respecting open-source alternative frontend to YouTube.

I’m open-source, check me out at GitHub.

permalink
report
parent
reply
3 points

New assymetric algos exist and the new standard is worked on right now IIRC (it might have been done already).

permalink
report
parent
reply
1 point

At 17:42 in the vid he talks about now algorithms, specifically one with vectors. His explanation is pretty good and comprehensable for not mathematically gifted people

permalink
report
parent
reply
4 points

Not happening soon and when it does, we’ll have better algorithms that can’t be cracked by quantum computers.

permalink
report
reply
4 points

There are already quite a few approaches to quantum safe encryption. We’ll just have to switch to different algorithms. It’s really nothing to worry about.

https://en.m.wikipedia.org/wiki/Post-quantum_cryptography

permalink
report
reply

Asklemmy

!asklemmy@lemmy.ml

Create post

A loosely moderated place to ask open-ended questions

Search asklemmy 🔍

If your post meets the following criteria, it’s welcome here!

  1. Open-ended question
  2. Not offensive: at this point, we do not have the bandwidth to moderate overtly political discussions. Assume best intent and be excellent to each other.
  3. Not regarding using or support for Lemmy: context, see the list of support communities and tools for finding communities below
  4. Not ad nauseam inducing: please make sure it is a question that would be new to most members
  5. An actual topic of discussion

Looking for support?

Looking for a community?

Icon by @Double_A@discuss.tchncs.de

Community stats

  • 7.7K

    Monthly active users

  • 5.5K

    Posts

  • 303K

    Comments