Difference between revisions of "Public Key Cryptography"
|Line 20:||Line 20:|
Revision as of 16:05, 18 April 2019
Full Title or Meme
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 an asymmetric mathematical algorithm that is easy if you have the private key, but statistically impossible if you do not.
- Existing cryptographic algorithms, like RSA or Elliptic Curve, work well today with compute power available to all.
- Successful Quantum Computing creates an existential threat to existing algorithms since quantum computing algorithms exist to crack traditionally intractable solutions like RSA.
- 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.