Details

Autor(en) / Beteiligte

• de Castro Biage, Gustavo
• Zambonin, Gustavo
• Idalino, Thais B.
• Panario, Daniel
• Custodio, Ricardo

Titel

A Concrete LIP-Based KEM With Simple Lattices

Ist Teil von

• IEEE access, 2024, Vol.12, p.16408-16420

Ort / Verlag

Piscataway: IEEE

Erscheinungsjahr

2024

Quelle

Free E-Journal (出版社公開部分のみ）

Beschreibungen/Notizen

• Recent developments have been made in the construction of cryptosystems with security based on the hardness of the lattice isomorphism problem (LIP). Due to lattice conjectures, one may expect in the future that breaking such schemes is computationally harder than most current lattice-based cryptosystems. To the best of our knowledge, there have not been any attempts to concretely instantiate a key encapsulation mechanism (KEM) based on LIP. In this work, we propose the first instance of such a KEM, following the framework of Ducas and van Woerden (EUROCRYPT 2022), using simple lattices. We present a randomness extractor derived from a hash function based on the short integer solution problem; define a concrete set of parameters for instantiating the scheme; provide a rigorous security estimation of an attacker trying to decode an encapsulated key through reductions to hard lattice problems; and use well-known methods to convert the IND-CPA secure KEM into an IND-CCA2 secure KEM, comparing the latter with other modern lattice-based KEMs. The resulting security is estimated under the assumption that an adversary cannot efficiently solve related instances of LIP, which is a consequence of the lack of cryptanalysis towards identifying isomorphism between lattices.