A Concrete LIP-Based KEM With Simple Lattices

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 cryptosy...

Full description

Bibliographic Details
Main Authors: Gustavo de Castro Biage, Gustavo Zambonin, Thais B. Idalino, Daniel Panario, Ricardo Custodio
Format: Article
Language:English
Published: IEEE 2024-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/10417023/