Post-Quantum Cryptography (PQCrypto)
In ~10 years Quantum Computers will break todays common asymmetric public-key cryptography algorithms used for web encryption (https), e-mail encryption (gnupg...), ssh and others. |
Contents
Quantum Computers[edit]
Quantum computers are based on the phenomena of quantum mechanics, as opposed to familiar classical computers based on transistors which encode data into binary digits (bits). In traditional computing, this process always leads to one of two possible states (0 or 1). ^{[1]} However, quantum computation relies on qubits that can express many different states simultaneously ("superpositions"), meaning that when/if this technology is fully developed, it will be capable of solving some types of mathematical problems virtually instantaneously. ^{[2]} ^{[3]}
Assembling a quantum computer is now an engineering problem rather than one impeded by laws of physics -- a theoretically imperfect machine can still yield useful results. Military and government agencies have invested heavily in this area because of the implications for today's widely used public-key cryptography. ^{[4]} Ciphertext that is invulnerable to classical computing will be shredded into ribbons by a large-scale quantum computer. Similarly, all Tor traffic will be vulnerable until quantum-resistant cryptography is implemented.
The Snowden documents reveal that all encrypted data traversing the internet is intercepted and stored indefinitely for cryptanalysis should there be a scientific breakthrough. A global arms race has ensued between the United States, EU, Russia, China, Israel and other global powers due to the immense geo-political, economic, intelligence and military advantages this technology would confer.
In 2018, the academic and corporate consensus is that a large quantum computer will be built in around 10-15 years. It is safe to assume that well-funded intelligence communities are capable of greatly reducing this development period.
Broken and Impacted Cryptographic Algorithms[edit]
The US National Institute of Standards and Technology has recently summarized the impact of quantum computing on common cryptographic algorithms.
Table: Cryptographic Impacts of Quantum Computing
Cryptographic Algorithm | Type | Purpose | Quantum Computer Impact |
---|---|---|---|
AES-256 | Symmetric Key | Encryption | Larger Key Sizes Needed |
SHA-256. SHA-3 | - | Hash Functions | Larger Output Needed |
RSA | Public Key | Signatures, Key Establishment | No Longer Secure |
ECDSA, ECDH ^{[5]} | Public Key | Signatures, Key Exchange | No Longer Secure |
DSA ^{[6]} | Public Key | Signatures, Key Exchange | No Longer Secure |
The emergence of quantum computers would break all asymmetric public-key cryptography and signature algorithms used today -- the type of cryptography that protects communications over the internet. The size of symmetric keys is also halved, meaning the strength of 256-bit keys would be equivalent to 128-bit keys. This is the type of cryptography used for Full Disk Encryption, when data is encrypted with a passphrase.
All current generation symmetric cryptographic authenticated modes such as CBC-MAC, PMAC, GMAC, GCM, and OCB are completely broken. This also applies to many CAESAR competition candidates: CLOC, AEZ, COPA, OTR, POET, OMD, and Minalpher. ^{[7]}
For more details visit https://pqcrypto.org/
Post-quantum Cryptography[edit]
The solution to this threat is Post-quantum Cryptography ("PQ Crypto"). This provides a drop-in replacement for cryptographic libraries already deployed, except different types of "quantum-hard" mathematical problems are used so cryptanalysis is difficult for both classical and quantum computers.
Competent cryptographers are gradually improving the performance of PQ Crypto and designing cipher-suites that are efficient for everyday use. For instance:
- Initial recommendations for PQ Crypto algorithms were published in September 2015.
- The Tor Project is planning to migrate to quantum-resistant ciphers by version 0.3.X. To follow Tor child tickets related to this transition, see here.
Software[edit]
The Free Software listed below is known to resist quantum computers, but this is not an endorsement for any particular tool. To mitigate potential exposure to unknown software implementation failures, it is recommended to set up arbitrary protocols over Tor Onion Services once PQ Crypto is deployed. The exception is the use of one-time pads which are secure from an information-theoretic perspective.
Before adopting any software, first consider if: ^{[8]}
- Cryptographic libraries were written by competent cryptographers and audited for correct implementation.
- Quantum-resistant algorithms have withstood susbstantial cryptanalytic efforts.
- The software has been widely adopted to help users blend in.
Setup Guides[edit]
Codecrypt[edit]
This is a GnuPG-like Unix program for encryption and signing that only uses quantum-resistant algorithms:^{[9]} ^{[10]}
- McEliece cryptosystem (compact QC-MDPC variant) for encryption.
- Hash-based Merkle tree algorithm (FMTSeq variant) for digital signatures.
Codecrypt is free software. The code is licensed under terms of LGPL3 in order to make combinations with other tools easier.
Use Instructions[edit]
Since Whonix 14, Codecrypt is included by default. See the Codecrypt manual page for common use-cases.
Basic Commands[edit]
Generate a strong(er) asymmetric encryption key.
ccr -g ENC-256 -N [keyname]
Export specified public key for sharing with contacts.
ccr -F [keyname] -ap > [keyname]
Export specified private key. The -F
parameter chooses the key to be used. To enumerate all keys in the keyring run ccr -k
for public ones and ccr -K
for private.
ccr -F [keyname] -aP > [keyname]
Key Management[edit]
Back-up keys: It is easier to backup the ccr folder in the home directory, changing its name from/to .ccr
upon restore. Enable hidden file view with alt + .
to see it.
Import a public key.
ccr -ai < [contactkey]
Import a private key.
ccr -aI < [myprivatekey]
Encrypt a plaintext message file only to an already imported contact key. Note this will be inaccessible to you. Save a plaintext copy for archival purposes.
ccr -aer [contactkey] -R plaintext > ciphertext
Decrypt a ciphertext message creating plaintext output.
ccr -adR ciphertext > plaintext
Message Formatting[edit]
Even without direct Thunderbird support, it is still possible to format messages to account for replies. However users should be careful to not mistakenly send unencrypted replies. TorBirdy disables draft syncing on the host e-mail server, however it is still advisable to disable the Internet connection temporarily in case the send button is accidentally pressed before the message is encrypted with Codecrypt.
Steps:
- Click reply in Thunderbird and copy the string "John Doe:"
- Format the correspondent's text as a reply by pasting it:
Edit
->Paste As Quotation
- Copy the result to the text editor window. Continue composing the message with your replies interspersed between the quotes.
- Save and encrypt.
- Paste the ciphertext into the Thunderbird reply window and completely replace the existing text.
- Re-establish the Internet connection, then press send.
OneTime[edit]
One-time pads are the only provably unbreakable encryption scheme ever invented, assuming a functional and non-backdoored random number generator (RNG). ^{[11]} ^{[12]} OneTime ^{[13]} is a program that sets up a one-time pad on a user's computer, and helps to protect from reuse of pads which breaks the overall security model. OneTime is available in Debian. ^{[14]}
OneTime can encrypt any kind of file -- it does not matter if the file's contents are Base64-encoded or not, because OneTime is not interpreting the contents. OneTime simply treats the file as a string of bits. Notably this is true for most encryption software; OneTime is not unique in this regard.
One-time pads should be completely secure against cryptographic attacks by quantum computers or other avenues. So long as the encryption key is truly random and the key is as long as the message, then all possible plaintexts are equally likely. Quantum computers are not telepathic, so messages properly encrypted with a one-time pad will remain impervious to cryptographic attacks. Of course, using the system is difficult in practice due to the logistics of key exchange, but quantum computing does not affect that reality. ^{[15]}
One-time pads come with several limitations:
- The message and the key are identical in size; this issue is negated by the large size of contemporary HDD/SSDs.
- It is impossible to securely contact strangers because the pad file must be exchanged in person or by other trustworthy peers. Sending the pad online only makes it as strong as the asymmetric cryptography that is in use.
- Message integrity cannot be verified, meaning there is no way for the recipient to discover if the ciphertext was tampered with during transit.
- The pad can never be used to encrypt additional messages. If this advice is ignored, the encryption is broken. ^{[16]}
Miscellaneous[edit]
Footnotes[edit]
- ↑ https://en.wikipedia.org/wiki/Quantum_computer
- ↑ In 2018, the technology is still reported to be in its infancy and only capable of solving basic problems, but it is developing rapidly. No problems have yet been solved faster than with a classical computer.
- ↑ For instance, a single qubit can represent a 0, 1, or quantum superposition of those two qubit states. A qubit pair can be in a superposition of 4 states, three qubits can be in a superposition of 8 states and so on. Quantum computers with n qubits can be in a superposition of 2^{n} different states simultaneously.
- ↑ Also explaining why the NSA shifted to quantum-resistant cryptography in 2016.
- ↑ Elliptic Curve Cryptography.
- ↑ Finite Field Cryptography.
- ↑ Breaking Symmetric Cryptosystems using Quantum Period Finding
- ↑ https://forums.whonix.org/t/post-quantum-cryptography-pqc/2011/17
- ↑ https://gitea.blesmrt.net/exa/codecrypt
- ↑ http://e-x-a.org/codecrypt/
- ↑ https://en.wikipedia.org/wiki/One-time_pad
- ↑ http://users.telenet.be/d.rijmenants/en/onetimepad.htm
- ↑ https://github.com/kfogel/OneTime
- ↑ https://packages.debian.org/search?searchon=names&keywords=onetime
- ↑ https://github.com/kfogel/OneTime/issues/14#issuecomment-218038898
- ↑ https://en.wikipedia.org/wiki/Venona_project#Decryption
No user support in comments. See Support.
Comments will be deleted after some time. Specifically after comments have been addressed in form of wiki enhancements. See Wiki Comments Policy.
Want to help create awesome, up-to-date screenshots for the Whonix wiki? Help is most welcome!
This is a wiki. Want to improve this page? Help is welcome and volunteer contributions are happily considered! Read, understand and agree to Conditions for Contributions to Whonix, then Edit! Edits are held for moderation.
Copyright (C) 2012 - 2019 ENCRYPTED SUPPORT LP. Whonix is a trademark. Whonix is a licensee of the Open Invention Network. Unless otherwise noted, the content of this page is copyrighted and licensed under the same Freedom Software license as Whonix itself. (Why?)
By using our website, you acknowledge that you have read, understood and agreed to our Privacy Policy, Cookie Policy, Terms of Service, and E-Sign Consent. Whonix is provided by ENCRYPTED SUPPORT LP. See Imprint.
Enable comment auto-refresher