Git-Mirrors/quantum-computing-toolkit
1
0
Fork 0
mirror of https://github.com/autistic-symposium/quantum-computing-toolkit.git synced 2025-05-12 11:32:14 -04:00
Code Issues Projects Releases Packages Wiki Activity

* almost all public-key cryptography right now could be broken with just a few advances in quantum computing * the commonly-used public-key algorithms are based: factoring (rsa), finite field discrete logarithms (diffie-hellman), and elliptic curve discrete logarithms (ecdh and ecdsa) - the hidden subgroup problem, which quantum computers are good at solving * modern design of post-quantum algorithms: - make constant-time implementations easy, reducing the risk of timing attacks - reduce reliance on random number generators (rngs) by extending nonce values with deterministic functions (shake) - implement random sampling techniques for non-uniform distributions, reducing the risk of attacks that rely on biased sampling - many are fully deterministic in their input reducing nonce reuse issues - many are designed to allow quick and easy generation of new keys, making it easier to provide forward secrecy

Browse source
This commit is contained in:
autistic-symposium-helper 2024-11-21 17:46:48 -08:00 • committed by GitHub
parent 0d2f967bc2
commit e28e0cccff
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
1 changed files with 16 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

17
post_quantum_crypto/README.md
View file

@ -1,7 +1,22 @@
## post-quantum cryptography ## quantum cryptography
<br> <br>
### tl; dr
* almost all public-key cryptography right now could be broken with just a few advances in quantum computing
* the commonly-used public-key algorithms are based: factoring (rsa), finite field discrete logarithms (diffie-hellman), and elliptic curve discrete logarithms (ecdh and ecdsa) - the hidden subgroup problem, which quantum computers are good at solving
* modern design of post-quantum algorithms:
- make constant-time implementations easy, reducing the risk of timing attacks
- reduce reliance on random number generators (rngs) by extending nonce values with deterministic functions (shake)
- implement random sampling techniques for non-uniform distributions, reducing the risk of attacks that rely on biased sampling
- many are fully deterministic in their input reducing nonce reuse issues
- many are designed to allow quick and easy generation of new keys, making it easier to provide forward secrecy
<br>
------
### shor's algorithm ### shor's algorithm
<br> <br>