Difference between revisions of "Quantum Computing Threat"
(Created page with "==Full Title or Meme== Successful Quantum Computing creates an existential threat to existing algorithms since quantum computing algorithms exist...")
Revision as of 07:18, 25 September 2018
Full Title or Meme
Successful Quantum Computing creates an existential threat to existing algorithms since quantum computing algorithms exist to crack traditionally intractable solutions like RSA.
Public key cryptography relies on certain mathematical problems that are very hard to solve, such as factoring large numbers that are the product of large prime numbers or finding the discrete logarithm of a random elliptic curve element with respect to a publicly known base point. If you know the private key components, you can sign the document or decrypt the data. If you don't have the private key and cannot solve the math, you cannot sign the document or decrypt the data.
- Find new asymmetric mathematical algorithm that is not susceptible to cracking with quantum computing.
- Revert to secret key algorithms which appear to be immune to cracking with quantum computing.
- "Report on Post-Quantum Cryptography"
- ImperialViolet: Post-quantum confidentiality for TLS (2018-04-11)