Well, that's not entirely true. There is such a thing as a type of cryptography that is resistant to attack with quantum computers. It's just, what's the best way to do that? It's just math.
Well, we know what sorts of math we use for encryption now, primarily all cryptography is based on the prime factorization problem, and we know that an algorithm, Shor's algorithm, can do that in less than exponential time on a quantum computer. We know what class of problems that is, and we know that any algorithm that can solve a problem in that class can be modified to solve all problems in that class and then more. So we know what classes of problems cannot be solved using a solution to one of those, and we know enough about the math with quantum computers and those problems that we can say probably some set of math problems cannot be solved efficiently on a quantum computer. So we pick those math problems, develop cryptography based on them and test it out.
Some more information to help you understand it:
https://en.m.wikipedia.org/wiki/NP-completeness
https://en.m.wikipedia.org/wiki/Computational_complexity_theory
mister_monster
npub1m5…jgjl3
2024-10-23 14:40:41
in reply to nevent1q…jm4m
Author Public Key
npub1m5s9w4t03znyetxswhgq0ud7fq8ef8y3l4kscn2e8wkvmv42hh3qujgjl3Published at
2024-10-23 14:40:41Event JSON
{
"id": "e6b924737d98aea5b2d160003cffca9a2869a3cbbf87a2ec527acf1ef089db8a",
"pubkey": "dd2057556f88a64cacd075d007f1be480f949c91fd6d0c4d593baccdb2aabde2",
"created_at": 1729694441,
"kind": 1,
"tags": [
[
"e",
"4220d3fea9b344d165041573f9b49214c520fabc1da82431e79e684352b55e2f",
"",
"root"
],
[
"p",
"ac3f6afe17593f61810513dac9a1e544e87b9ce91b27d37b88ec58fbaa9014aa"
],
[
"r",
"https://en.m.wikipedia.org/wiki/NP-completeness"
],
[
"r",
"https://en.m.wikipedia.org/wiki/Computational_complexity_theory"
]
],
"content": "Well, that's not entirely true. There is such a thing as a type of cryptography that is resistant to attack with quantum computers. It's just, what's the best way to do that? It's just math.\n\nWell, we know what sorts of math we use for encryption now, primarily all cryptography is based on the prime factorization problem, and we know that an algorithm, Shor's algorithm, can do that in less than exponential time on a quantum computer. We know what class of problems that is, and we know that any algorithm that can solve a problem in that class can be modified to solve all problems in that class and then more. So we know what classes of problems cannot be solved using a solution to one of those, and we know enough about the math with quantum computers and those problems that we can say probably some set of math problems cannot be solved efficiently on a quantum computer. So we pick those math problems, develop cryptography based on them and test it out.\n\nSome more information to help you understand it:\n\nhttps://en.m.wikipedia.org/wiki/NP-completeness\n\nhttps://en.m.wikipedia.org/wiki/Computational_complexity_theory",
"sig": "94d1290eda1cc1921feaeeb84992e9cd3f2049371fbe22ef8225cc02f72c4ce661df61f47477ecadb37b3e64e18dc9217484e6fb9c09aa4bf09cd51749c4b6f3"
}