WebWe 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 transformation mapping L 1 to L 2. Our main result is an algorithm for this problem running in time n O (n) times a polynomial in the input size, where n is the rank of the input lattices. WebWe 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 transformation mapping …

[1605.03613] On the Lattice Distortion Problem - arXiv.org

WebOn the Lattice Isomorphism Problem, Quadratic Forms, Remarkable Lattices, and Cryptography L´eo Ducas1,2 and Wessel van Woerden1(B) 1 CWI, Cryptology Group, Amsterdam, The Netherlands [email protected] 2 Mathematical Institute, Leiden University, Leiden, The Netherlands Abstract. A natural and recurring idea in the knapsack/lattice cryp- Webfactors, which is central in lattice-based cryptography), LIPis unlikely to be NP-hard. We note, though, that the reduction from the Graph Isomorphism Problem (GIP) [15] gives … biosphere tucson az tickets

Paper: Hull Attacks on the Lattice Isomorphism Problem

WebThis work provides generic realizations of this natural idea of starting from a lattice with remarkable decoding capability as your private key, and hide it somehow to make a … Webcentral in lattice-based cryptography), LIP is unlikely to be NP-hard. We note, though, that the reduction from the Graph Isomorphism Problem (GIP) [14] gives some evidence … WebWe 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 transformation mapping L_1 to L_2. Our main result is an algorithm for this problem running in time n^ {O (n)} times a polynomial in the input size, where n is the rank of the input lattices. dairy testing labs near me