A Post Quantum Crypto Solution
#1
There is a program called CodeCrypt which is basically a gnuPG like command-line program.
It uses McEliece QC MDPC for encryption and hash based Merkle Tree algorithm for
Signing . It is resistant to both Shor's and Grover's algorithm and is proven unbreakable.
Give it a try . 
Here is the link :
https://github.com/exaexa/codecrypt
Reply
#2
(06-06-2017, 05:43 AM)Delta_Ghost Wrote: There is a program called CodeCrypt which is basically a gnuPG like command-line program.
It uses McEliece QC MDPC for encryption and hash based Merkle Tree algorithm for
Signing . It is resistant to both Shor's and Grover's algorithm and is proven unbreakable.
Give it a try . 
Here is the link :
https://github.com/exaexa/codecrypt

"and is proven unbreakable."

I'd be careful about making such claims, the McEliece cryptosystem itself is clearly broken: "Attacking and defending the McEliece cryptosystem" http://eprint.iacr.org/2008/318.pdf

However that paper resulted in some improvements to the cryptosystem which is implemented by CodeCrypt and to this point has not been broken.There is a big difference between not broken and proven unbreakable though.

With regards to Gover's algorithm, alone it is fairly resistant however applying Gover's algorithm to current information-set decoding algorithms results in a significant speed up. "Grover vs McEliece" https://webcache.googleusercontent.com/s...clnk&gl=ca (sorry for the google cache, the original at cr.yp.to is down at the time of writing this post).

However, in all honesty I'm not as familiar with either code-based cryptosystem as I am with lattice based crypto (namely NTRU). I believe the second point is referencing the McEliece more secure variant using a Goppa Code but the paper goes a bit over my head so I'm not confident in that. None-the-less I wouldn't refer to the cryptosystem as "proven unbreakable" the only cryptosystem that gets that honor is the one-time-pad.
Reply
#3
Yes you are absolutely correct, nothing is "proven unbreakable" except one time pad
which is information theoretically secure and is mathematically
proven to be unbreakable. Forgive my mistake.
There are some points that I want to mention though :
1. McEliece QC MDPC variant is fairly secure against Grover's algo for large enough key
sizes.
2. McEliece Binary goppa code based cryptosystem would have large public key for 2^128 bit
security which makes their usage problematic , compared to Quasi cyclic MDPC which has
smaller key size for the same security level. (2^128)
3. The only caveat of MDPC would be that it is a tad too much susceptible to timing
attacks but it should not be of any concerns as you are not using it for online
purposes.
Reply


Possibly Related Threads…
Thread Author Replies Views Last Post
  Post-quantum cryptography – dealing with the fallout of physics success [Whitepaper] Cypher 1 14,078 05-28-2017, 06:40 PM
Last Post: Insider
  Crypto 101 [Introductory course for crypto] Insider 1 14,290 08-15-2015, 09:55 PM
Last Post: NO-OP