this post was submitted on 13 Oct 2024
103 points (80.8% liked)

Technology

58702 readers
4341 users here now

This is a most excellent place for technology news and articles.


Our Rules


  1. Follow the lemmy.world rules.
  2. Only tech related content.
  3. Be excellent to each another!
  4. Mod approved content bots can post up to 10 articles per day.
  5. Threads asking for personal tech support may be deleted.
  6. Politics threads may be removed.
  7. No memes allowed as posts, OK to post as comments.
  8. Only approved bots from the list below, to ask if your bot can be added please contact us.
  9. 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
[–] [email protected] 60 points 3 days ago (27 children)

I love how it did not at all explain what they broke. It mentioned "rectangle"? Whats that? How does it have any relation to AES? Because AES is NOT vulnerable to quantum computing. Did they get the key by knowing the ciphertext and the original data?

[–] [email protected] 2 points 2 days ago (2 children)

There's Grover's algorithm which can help in cracking the key.

https://crypto.stackexchange.com/questions/6712/is-aes-256-a-post-quantum-secure-cipher-or-not#7869

Regardless, everything sane uses 256 bit AES. Should be ok for now.

[–] [email protected] 2 points 2 days ago (1 children)

AES works with a shared key. This won't work when you want to have an encrypted connection with a webshop (how would you get the key over there in a secure way?). For this you have asynchronous key algorithms such as RSA en ECDH. These algorithms can make a secure connection without anything preshared. Usually this is used to compute a shared key and then continue over AES. These asynchronous algorithms are at risk of being cracked with quantum computers.

[–] [email protected] 1 points 1 day ago

My point is that AES isn't untouched by quantumn computing. We now have quantumn safe asymmetric key encryption, too.

Grover's algorithm gives broad asymptotic speed-ups to many kinds of brute-force attacks on symmetric-key cryptography.

Source: https://en.m.wikipedia.org/wiki/Grover's_algorithm#Cryptography

load more comments (24 replies)