Cryptanalysis of rank-2 module-LIP in totally real number fields
From MaRDI portal
Publication:6637723
DOI10.1007/978-3-031-58754-2_9MaRDI QIDQ6637723
Alexandre Wallet, Georgii Pliatsok, Guilhem Mureau, Alice Pellet-Mary
Publication date: 13 November 2024
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Cyclotomic extensions (11R18) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Factoring polynomials over global fields
- Approximating rings of integers in number fields
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Short Bases of Lattices over Number Fields
- Advanced Topics in Computional Number Theory
- Bounds on 2-torsion in class groups of number fields and integral points on elliptic curves
- Testing Isomorphism of Lattices over CM-Orders
- On the Lattice Isomorphism Problem
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Algorithmic Number Theory
- Classical hardness of learning with errors
- Explicit bounds for residues of Dedekind zeta functions, values of \(L\)-functions at \(s=1\), and relative class numbers
- Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
- Hull attacks on the lattice isomorphism problem
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- Ideal-SVP is hard for small-norm uniform prime ideals
This page was built for publication: Cryptanalysis of rank-2 module-LIP in totally real number fields
