Performance evaluation of liboqs in Open Quantum Safe project (Part I)

Famous public key cryptosystem such as RSA and Diffie-Hellman is not secure against quantum computer. Also, the emergence of quantum computers is not theoretical but is actually in practical. Post-Quantum Cryptography (PQC) means quantum-resistant cryptography. Lattice-based cryptography has been known as one of PQC. Learning with Errors (LWE), Ring Learning with Errors (Ring-LWE), and Module Learning with Errors(Module-LWE) are the mathematical hard problems in lattice-based cryptography. In public domain, Open Quantum Safe (OQS) project develops quantumresistant cryptosystems such as lattice-based, code-based, and supersingular isogeny elliptic curve as open source. We focus on lattice-based OQS projects such as BCNS15, NewHope, MSrln, Kyber, and Frodo. In this paper, we check and compare the performance of OQS key exchange protocols using lattices. Then, we suggest future work in OQS project.

[1]  Damien Stehlé,et al.  CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM , 2017, 2018 IEEE European Symposium on Security and Privacy (EuroS&P).

[2]  Craig Costello,et al.  Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem , 2015, 2015 IEEE Symposium on Security and Privacy.

[3]  Douglas Stebila,et al.  Post-quantum Key Exchange for the Internet and the Open Quantum Safe Project , 2016, SAC.

[4]  Oded Regev,et al.  On lattices, learning with errors, random linear codes, and cryptography , 2009, JACM.

[5]  Jianhua Chen,et al.  Provably Secure Three-party Password Authenticated Key Exchange Protocol Based On Ring Learning With Error , 2017, IACR Cryptol. ePrint Arch..

[6]  Damien Stehlé,et al.  Worst-case to average-case reductions for module lattices , 2014, Designs, Codes and Cryptography.

[7]  David Jao,et al.  Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies , 2011, J. Math. Cryptol..

[8]  Erdem Alkim,et al.  Post-quantum Key Exchange - A New Hope , 2016, USENIX Security Symposium.

[9]  Chris Peikert,et al.  On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.

[10]  Steven M. Bellovin,et al.  Encrypted key exchange: password-based protocols secure against dictionary attacks , 1992, Proceedings 1992 IEEE Computer Society Symposium on Research in Security and Privacy.

[11]  Craig Costello,et al.  Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE , 2016, IACR Cryptol. ePrint Arch..

[12]  Jintai Ding,et al.  A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem , 2012, IACR Cryptol. ePrint Arch..

[13]  Patrick Longa,et al.  Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography , 2016, CANS.

[14]  Chris Peikert,et al.  Lattice Cryptography for the Internet , 2014, PQCrypto.

[15]  Joseph H. Silverman,et al.  NTRU: A Ring-Based Public Key Cryptosystem , 1998, ANTS.

[16]  Jiang Zhang,et al.  Two-Round PAKE from Approximate SPH and Instantiations from Lattices , 2017, ASIACRYPT.

[17]  Hugo Krawczyk,et al.  HMQV: A High-Performance Secure Diffie-Hellman Protocol , 2005, CRYPTO.

[18]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[19]  Peter Schwabe,et al.  McBits: Fast Constant-Time Code-Based Cryptography , 2013, CHES.

[20]  Craig Costello,et al.  Efficient Algorithms for Supersingular Isogeny Diffie-Hellman , 2016, CRYPTO.

[21]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[22]  Jonathan Katz,et al.  Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices , 2009, ASIACRYPT.

[23]  Jintai Ding,et al.  Authenticated Key Exchange from Ideal Lattices , 2015, EUROCRYPT.

[24]  Jintai Ding,et al.  Provably Secure Password Authenticated Key Exchange Based on RLWE for the Post-Quantum World , 2017, CT-RSA.