this post was submitted on 02 Aug 2026
6 points (60.0% liked)
Showerthoughts
43184 readers
148 users here now
A "Showerthought" is a simple term used to describe the thoughts that pop into your head while you're doing everyday things like taking a shower, driving, or just daydreaming. The most popular seem to be lighthearted clever little truths, hidden in daily life.
Here are some examples to inspire your own showerthoughts:
- Both “200” and “160” are 2 minutes in microwave math
- When you’re a kid, you don’t realize you’re also watching your mom and dad grow up.
- More dreams have been destroyed by alarm clocks than anything else
Rules
- All posts must be showerthoughts
- The entire showerthought must be in the title
- No politics
- If your topic is in a grey area, please phrase it to emphasize the fascinating aspects, not the dramatic aspects. You can do this by avoiding overly politicized terms such as "capitalism" and "communism". If you must make comparisons, you can say something is different without saying something is better/worse.
- A good place for politics is c/politicaldiscussion
- Posts must be original/unique
- Adhere to Lemmy's Code of Conduct and the TOS
If you made it this far, showerthoughts is accepting new mods. This community is generally tame so its not a lot of work, but having a few more mods would help reports get addressed a little sooner.
Whats it like to be a mod? Reports just show up as messages in your Lemmy inbox, and if a different mod has already addressed the report, the message goes away and you never worry about it.
founded 3 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
With regards to extracting the private key from the public key, to my knowledge there is shors algorithm that runs in polynomial time on a quantum computer that solves integer factorisation.
Solve integer factorisation in P and you break RSA in P. I believe there are similar P algorithms that run on quantum computers for the discrete logarithm problem and elliptic curve discrete logarithm problem.
In this sense, if you scale quantum computers resources enough you break modern asymmetric cryptography.
With regards to breaking AES: Quantum computers halve the security. So 256 bit security goes to 128 bits. Still secure.
AES 128 goes to 64 bits of security. Hmmm maybe not secure anymore. Have a read of post quantum cryptography and shors algorithm to see what im on about
EDIT: added important details
Edit 2: so so many typos
https://thequantuminsider.com/2026/04/21/cryptologist-finds-aes-128-likely-safe-from-quantum-attack/
That's different reasons why we should switch (larger blocks means better randomized modes), but quantum computers still needs to much energy and too much time to attack AES128 with Grover's algorithm
I'm not claiming you can't do it faster. I'm claiming it's impossible to skip the related fundamental energy requirements.
Energy requirements scale exponentially on a polynomial time algorithm? That doesnt make sense. I admit however I have only studied quantum computers in relation to what they can do, not how. But I hope what I am saying makes sense.
I'm not an expert in quantum computing. The whole point of this thought experiment is to skip all all the mechanics and make an argument based on general fundamental thermodynamic limitations.
Thermodynamics is derived from quantum physics. Quantum computing is derived from quantum physics. They are not bypassing the thermodynamic limitations. Instead the problems the researchers keep running into are related to noise.