Cryptanalysis of Compact-LWE and Related Lightweight Public Key Encryption

الملخص EN

In the emerging Internet of Things (IoT), lightweight public key cryptography plays an essential role in security and privacy protection.

With the approach of quantum computing era, it is important to design and evaluate lightweight quantum-resistant cryptographic algorithms applicable to IoT.

LWE-based cryptography is a widely used and well-studied family of postquantum cryptographic constructions whose hardness is based on worst-case lattice problems.

To make LWE friendly to resource-constrained IoT devices, a variant of LWE, named Compact-LWE, was proposed and used to design lightweight cryptographic schemes.

In this paper, we study the so-called Compact-LWE problem and clarify that under certain parameter settings it can be solved in polynomial time.

As a consequence, our result leads to a practical attack against an instantiated scheme based on Compact-LWE proposed by Liu et al.

in 2017.