Efficient lattice-based signature scheme (Q1001681)

Summary: In Crypto 1997, \textit{O. Goldreich}, \textit{S. Goldwasser} and \textit{S. Halevi} [Lect. Notes Comput. Sci. 1294, 112--131 (1997; Zbl 0889.94011)] (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximating the Closest Vector Problem in a lattice. Furthermore, they also described how to use the same principle of their encryption scheme to provide a signature scheme. Practically, this cryptosystem uses the Euclidean norm, \(l_2\)-norm, which has been used in many algorithms based on lattice theory. Nonetheless, many drawbacks have been studied and these could lead to cryptanalysis of the scheme. In this article, we present a novel method of reducing a vector under the \(l_{\infty} \)-norm and propose a digital signature scheme based on it. Our scheme takes advantage of the \(l_{\infty}\)-norm to increase the resistance of the GGH scheme and to decrease the signature length. Furthermore, after some other improvements, we obtain a very efficient signature scheme, that trades the security level, speed and space.