Cryptanalysis of Compact-LWE

Dennis Hofheinz, Kristina Hostáková, Julia Kästner +2 more

Javad Sharafi, Hassan Daghigh

Abstract In this article, we give a digital signature by using Lindner–Peikert cryptosystem. The security of this digital signature is based on the assumptions about hardness of Ring-LWE and Ring-SIS problems, along with providing public key and signature of compact (1–1.5 kilobytes) size. We prove the security of our signature scheme in the Quantum Random Oracle Model. Our cryptanalysis has been done based on methods of Aggarwal et al. and Chen et al.

Toi Tomita

Tan Soo Fun, Azman Samsudin

Ayman W. Mohsen, Ayman Mohammad Bahaa-Eldin, Mohamed Sobh

Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability. However, Quantum Computing threatens all the current PKCS as they offer a new model that can solve those hard problems, e.g. the factorization problem of RSA or the discrete logarithm problem of ELGAMAL algorithm. Lattice Based PKCS are a promising filed to introduce an immune cipher system against quantum cryptanalysis. This paper presents a summary of recent progress in the field of lattice-based cryptography, by focusing on the recent advancement in lattice-based public key cryptosystems and key exchange mechanisms based on the learning with errors (LWE) problem and its ring variant Ring-LWE.

Po-Wen Chi, Ming-Hung Wang, Yun‐Hsin Chuang