$DENS
Trending UpSnapshot Window: 2026-07-06 10:50 UTC · ← Back to Crypto Overview
Social Momentum Summary
Total Engagement - Comments: 0, Retweets: 0, Likes: 1, Impressions: 19
Verbatim Community Citations & Social Evidence 1 source posts analyzed
This is an important concept. Quantum computers attack mathematical structure. RSA and elliptic curve cryptography have exactly the kind of algebraic structure that Shor’s algorithm exploits. Hash functions don’t. That’s why they’re believed to remain quantum resistant. [Spoken audio]: I want to answer this question. Which kinds of cryptographic primitives are weakened or broken by a quantum computer, and which are not? So, broadly speaking, cryptographic primitives either have a lot of mathematical structure, I'll explain in a minute, or they are sort of completely structure less mathematically. And the things that have enough structure are broken by quantum computers. And the things that lack structure stay safe. So things that have a lot of structure usually are based on things like the hardness of factoring integers or something known as the discrete log problem. And a lot of protocols fall under this category. Things like RSA, Diffie-Hellman, elliptic curve cryptography, which includes elliptic curve DSA, the signatures in Bitcoin, in Ethereum. All of these things fall under the category of involving a lot of very nice math, a lot of structure, and quantum computers use that structure to break the cryptography. On the other hand, we have things like SHA-2, SHA-3, Kechak, Blake, AES, ZK starks that do not have a lot of structure in them. The way they encrypt and hide information is by mixing things together in a very non-mathematically structured way. And these things are immune to quantum computers. So summing up, the things that have a lot of structure, things based on elliptic curves, number theory, factoring integers, those things are broken by quantum computers whereas the things that lack structure like SHA-2, SHA-3, hashes, ZK Starks, these things stay immune.
