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.|
Quantum computers are based on the phenomena of quantum mechanics as opposed to classical computers familiar to everyone today. They are made up of qubits that can express many different states simultaneously, solving some types of mathematical problems in near instant time. 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. Such a computer is sought after by every heavy-weight signal intelligence agency because of implications for public-key cryptography systems widely used today. Ciphertext unbreakable by today's classical computers will be shredded into ribbons by a large quantum computer. The Snowden documents reveal that every piece of encrypted data traversing the internet is intercepted and stored indefinitely for decryption should there be a breakthrough. A global arms race by the United States, EU, Russia, China and Israel ensues.
The academic and corporate world estimate that a large quantum computer will be built in 10-15 years from now (as of 2016). Its safe to assume the time is even less for intelligence communities.
All asymmetric public-key crypto and signature algorithms used today - the type of crypto that protects your communications over the internet.
Symmetric crypto key size strength is halved (256-bit drops down to 128-bit) - the type used for Full Disk Encryption, encrypting data with a passphrase.
All current generation symmetric crypto authenticated modes are completely broken such as CBC-MAC, PMAC, GMAC, GCM, and OCB) are completely broken and this is also also applicable to many CAESAR competition candidate: CLOC, AEZ, COPA, OTR, POET,OMD, and Minalpher. 
For more details visit https://pqcrypto.org/
The answer is Post-Quantum (PQ) Cryptography. Its a drop in replacement for crypto libraries deployed now except it uses different types of math problems known to be "quantum hard" meaning its just as difficult for a Quantum Computer to solve as it is for Classical ones.
Competent cryptographers are in the process of improving performance of PQ Crypto and designing cipher-suites efficient for everyday use. The Tor Project are planning to migrate to quantum resistant ciphers by version 0.2.9.x.
Tor dev meeting: http://meetbot.debian.net/tor-dev/2016/tor-dev.2016-02-04-13.28.html
Initial recommendations for PQ Crypto algorithms were published September 2015.
This is a listing of Free Software known to known to resist quantum computers and not an endorsement for any particular tool. You are better off setting up arbitrary protocols over Tor Hidden Services once PQ crypto is deployed to mitigate exposure in case of unknown implementation failures in each and every other tool (with the exception of one-time pads that are information theoretically secure).
Informal adoption checklist:
- Quantum-resistant algorithms have withstood susbstantial cryptanalytic efforts.
- Crypto libraries written by competent cryptographers and audited for correct implementation.
- Widely adopted for better blending in.
- 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 a good hope that it will make combinations with other tools easier.
If you are interested in installation instructions, please press expand on the right.
Unfortunately not possible to install on Jessie even with apt pinning as it will mix core packages between stable and unstable causing Whonix to break. A supported version has already landed in Stretch however.
OneTime is a program that sets up a one-time pad on your computer and protects from reusing pads and shooting yourself in the foot. OneTime is available in Debian. One-time pads are the only provably unbreakable encryption scheme ever invented (assuming a functional/non-backdoored RNG).
OneTime can encrypt any kind of file -- it doesn't matter if the file's contents are Base64-encoded or not, because OneTime is not interpreting the contents of the file. It just treats the file as a string of bits. (The same is true of just about all encryption software, by the way; OneTime is not unique in this regard.)
One-time pads should be secure against cryptographic attacks by quantum computers for the same reason they're secure against any other kind of attack: if 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 there shouldn't be any way they can attack a message properly encrypted with a one-time pad. Indeed, there really is no possible cryptographic attack against such a message. (Of course, using the system in practice can be difficult, due to the logistics of key exchange, but quantum computing won't affect that.)
- The message and the key are identical in size - but with large hard-disks these days this is not a problem.
- There is no way to securely contact someone you don't know - you must exchange the pad file in person or by other trustworthy peers. Sending the pad online makes it as strong as the asymmetric crypto you are using.
- No message integrity. There is no way for the recipient to discover if the ciphertext has been tampered with during transit.
- You must never ever reuse the pad to encrypt another message. Doing so breaks the the encryption.
Impressum | Datenschutz | Haftungsausschluss
Conditions for Contributions to Whonix, then Edit! IP addresses are scrubbed, but editing over Tor is recommended. Edits are held for moderation. Whonix (g+) is a licensee of the Open Invention Network. Unless otherwise noted above, content of this page is copyrighted and licensed under the same Free (as in speech) license as Whonix itself.
- [https://arxiv.org/pdf/1602.05973v3.pdf Breaking Symmetric Cryptosystems using Quantum Period Finding]