Feb 15, 2023 · This problem is the lattice variant of the code equivalence problem, on which the notion of the hull of a code can lead to devastating attacks.

May 2, 2023 · This problem is the lattice variant of the code equivalence problem, on which the notion of the hull of a code can lead to devastating attacks.

The lattice isomorphism problem (LIP) asks one to find an isometry between two lattices. It has recently been proposed as a foundation for cryptography in two ...

All known attacks against ∆LIP solve SVP. SVP can be solved by lattice reduction. BKZ reduction with blocksize β runs in time 20.292β+o(β) [BDGL16].

The lattice isomorphism problem (LIP) asks one to find an isometry between two lattices. It has recently been proposed as a foundation for cryptography in ...

This problem is the lattice variant of the code equivalence problem, on which the notion of the hull of a code can lead to devastating attacks.

Hull Attacks on the Lattice Isomorphism Problem · List of references · Publications that cite this publication.

We study the Lattice Isomorphism Problem (LIP), in which given two lattices L_1 and L_2 the goal is to decide whether there exists an orthogonal linear ...

However, we note that these attacks are enabled by the fact that these schemes only re-randomize the lattice by applying a permutation of the co- ordinates.3 ...

Hull attacks on the lattice isomorphism problem. In Public-Key Cryptography (pp. 177–204). doi:10.1007/978-3-031-31368-4_7. Current projects with external ...