A Key Exchange Based on the Short Integer Solution Problem and the Learning with Errors Problem
Short integer solution (SIS) and learning with errors (LWE) are two hard lattice problems. These two problems are believed having huge potential in application of cryptography. In 2012, Ding et al.  introduced the first provably secure key exchange based on LWE problem. On the other hand, we believe that it is very difficult to do key exchange on SIS problem only. In 2014, Wang et al.  did an attempt, but it was not successful. Mao et al.  broke the protocol by an attack based on CBi-SIS problem in 2016. However, their attack is not efficient. In this paper, we present a extremely straightforward and simple attack to Wang’s key exchange and then we will construct a key exchange based on SIS and LWE problems.
KeywordsKey exchange SIS LWE Attack Lattice
This study is partially supported by U.S Air force.
- 1.Ajtai, M.: Generating hard instances of lattice problems. Quaderni di Matematica 13, 1–32 (2004). Preliminary version in STOC (1996)Google Scholar
- 4.Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84–93. ACM (2005)Google Scholar
- 5.Ding, J., Xiang, X., Lin, X.: A simple provably secure key exchange scheme based on the learning with errors problem. Cryptology ePrint Archive, Report 2012/688 (2012). https://eprint.iacr.org
- 9.Cabarcas, D., Florian, G., Patrick, W.: Provably secure LWE encryption with smallish uniform noise and secret. Cryptology ePrint Archive, Report 2013/164 (2013). https://eprint.iacr.org