Just how hard are rotations of Z^n? Algorithms and cryptography with the simplest lattice
From MaRDI portal
Publication:6083665
Recommendations
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- Theory of Cryptography
- scientific article; zbMATH DE number 2120513
- Lattice reductions over Euclidean rings with applications to cryptanalysis
- scientific article; zbMATH DE number 1302796
- scientific article; zbMATH DE number 5252113
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Rotated lattices via the cyclotomic field \(\mathbb Q(\zeta_{2^r})\)
- Computational aspects of lattices and their cryptographic applications
Cites work
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- A decade of lattice cryptography
- A reverse Minkowski theorem
- Approximating the densest sublattice from Rankin's inequality
- Bonsai trees, or how to delegate a lattice basis
- Classical hardness of learning with errors
- Computing a lattice basis revisited
- Cryptography and Coding
- Deciding orthogonality in construction-A lattices
- Discrete Gaussian sampling reduces to CVP and SVP
- Factoring polynomials with rational coefficients
- Faster exponential time algorithms for the shortest vector problem
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- scientific article; zbMATH DE number 2009972 (Why is no real title available?)
- scientific article; zbMATH DE number 2086714 (Why is no real title available?)
- Improved hardness results for unique shortest vector problem
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- Lattices with symmetry
- LWE with side information: attacks and concrete security estimation
- On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
- On the lattice isomorphism problem
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
- Probability Inequalities for Sums of Bounded Random Variables
- Revisiting the expected cost of solving uSVP and applications to LWE
- Revisiting the Gentry-Szydlo Algorithm
- Search-to-decision reductions for lattice problems with approximation factors (slightly) greater than one
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(22)- Fast Falcon signature generation and verification using ARMv8 NEON instructions
- Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Cryptanalysis of rank-2 module-LIP in totally real number fields
- An improvement of the congruence solver of lattice isomorphism problem over totally real number fields and applications
- Cryptanalysis of rank-2 module-LIP: a single real embedding is all it takes
- A reduction from Hawk to the principal ideal problem in a quaternion algebra
- Re-randomize and extract: a novel commitment construction framework based on group actions
- Rank-2 module-LIP with special matrices
- Dense and smooth lattices in any genus
- Cryptanalysis of rank-2 module-LIP with symplectic automorphisms
- Cryptanalysis of an efficient signature based on isotropic quadratic forms
- Relating code equivalence to other isomorphism problems
- Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding
- Improved provable reduction of NTRU and hypercubic lattices
- Properties of lattice isomorphism as a cryptographic group action
- A search to distinguish reduction for the isomorphism problem on direct sum lattices
- Fully-homomorphic encryption from lattice isomorphism
- Dimension-reducing algorithms for quaternion ideal-SVP
- Solving the shortest vector problem in \(2^{0.63269n+o(n)}\) time on random lattices
- Diagonally dominant matrices for cryptography
- \textsf{HAWK}: having automorphisms weakens key
This page was built for publication: Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083665)
