# Difference between revisions of "Quantum Computing Threat"

(→Solutions) |
(→References) |
||

(11 intermediate revisions by the same user not shown) | |||

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== | ||

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. | 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. | ||

− | == | + | ==Problems== |

− | + | * Many systems exist which depend on existing public key technology. Some of these are embedded in hardware that cannot be changed once deployed. | |

+ | * Existing signatures or encrypted files will continue to need to be processed for many years to come. Certificate keys have a life time of up to 25 years. | ||

+ | * The approval process for new cryptographic algorithms takes many years of standardization and test to be sure that the work effort to brake them is sufficiently high. | ||

==Solutions== | ==Solutions== | ||

+ | * [https://www.nist.gov/blogs/taking-measure/post-quantum-encryption-qa-nists-matt-scholl Post-Quantum Encryption: A Q&A With NIST’s Matt Scholl] 2021-10-27 | ||

+ | * [https://www.nccoe.nist.gov/projects/building-blocks/post-quantum-cryptography 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. | [[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. | ||

+ | * [https://nvlpubs.nist.gov/nistpubs/CSWP/NIST.CSWP.04282021.pdf Getting Ready for Post-Quantum Cryptography:] NIST 2021-04-28 - Exploring Challenges Associated with Adopting and | ||

+ | Using Post-Quantum Cryptographic Algorithms | ||

+ | * [https://www.nccoe.nist.gov/sites/default/files/library/project-descriptions/pqc-migration-project-description-draft.pdf MIGRATION TO POST-QUANTUM Cryptography] William Barker, Murugiah Souppaya NIST 2021-06 | ||

+ | * [https://csrc.nist.gov/publications/detail/nistir/8105/final "Report on Post-Quantum Cryptography"] | ||

+ | * [https://www.imperialviolet.org/ ImperialViolet: Post-quantum confidentiality for TLS (2018-04-11)] | ||

− | *[https:// | + | * [https://www.nsa.gov/what-we-do/cybersecurity/post-quantum-cybersecurity-resources/ NSA site] |

− | |||

==References== | ==References== | ||

Line 18: | Line 26: | ||

[[Category:Glossary]] | [[Category:Glossary]] | ||

+ | [[Category: Cryptography]] |

## Latest revision as of 17:33, 18 November 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.

## Problems

- Many systems exist which depend on existing public key technology. Some of these are embedded in hardware that cannot be changed once deployed.
- Existing signatures or encrypted files will continue to need to be processed for many years to come. Certificate keys have a life time of up to 25 years.
- The approval process for new cryptographic algorithms takes many years of standardization and test to be sure that the work effort to brake them is sufficiently high.

## Solutions

- Post-Quantum Encryption: A Q&A With NIST’s Matt Scholl 2021-10-27
- 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

- MIGRATION TO POST-QUANTUM Cryptography William Barker, Murugiah Souppaya NIST 2021-06
- "Report on Post-Quantum Cryptography"
- ImperialViolet: Post-quantum confidentiality for TLS (2018-04-11)