Difference between revisions of "Quantum Computing Threat"
(→Solutions) |
(→Full Title or Meme) |
||
| Line 1: | Line 1: | ||
==Full Title or Meme== | ==Full Title or Meme== | ||
| − | Successful [[Quantum Computing Threat|Quantum Computing]] creates an existential threat to existing algorithms since quantum computing algorithms exist to crack traditionally intractable | + | Successful [[Quantum Computing Threat|Quantum Computing]] creates an existential threat to existing cryptographic algorithms since quantum computing algorithms exist to crack traditionally intractable problems like factoring the multiplication of two large primes used in RSA. |
==Context== | ==Context== | ||
Revision as of 11:01, 9 June 2021
Full Title or Meme
Successful Quantum Computing creates an existential threat to existing cryptographic algorithms since quantum computing algorithms exist to crack traditionally intractable problems like factoring the multiplication of two large primes used in RSA.
Context
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.
Problem
Solutions
- Crypto Agility: Considerations for Migrating to Post-Quantum Cryptographic Algorithms NCCoE 21-06-05 cue on 2021-07-07
Public Key Cryptography has many benefits over Secret Key Cryptography, the effort to create new algorithm to preserve the current PK protocols is underway now.
- Getting Ready for Post-Quantum Cryptography: NIST 2021-04-28 - Exploring Challenges Associated with Adopting and
Using Post-Quantum Cryptographic Algorithms
- "Report on Post-Quantum Cryptography"
- ImperialViolet: Post-quantum confidentiality for TLS (2018-04-11)
