Exploiting the symmetry of Z^n: randomization and the automorphism problem

DOI10.1007/978-981-99-8730-6_6zbMATH Open1547.94377MaRDI QIDQ6604873FDOQ6604873

Authors: Kaijie Jiang, Anyu Wang, Guoxiao Liu, Yang Yu, Xiaoyun Wang

Publication date: 13 September 2024

gradient descent lattice automorphism randomized reduction \( \mathbb{Z}\)LIP characteristic vectors of the unimodular lattice

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Lattice packing and covering (number-theoretic aspects) (11H31)

Cites Work

Title not available (Why is that?)
How to generate random matrices from the classical compact groups
Factoring polynomials with rational coefficients
Trapdoors for hard lattices and new cryptographic constructions
Bonsai trees, or how to delegate a lattice basis
The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
Title not available (Why is that?)
Computing isometries of lattices
Classical hardness of learning with errors
Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
Title not available (Why is that?)
On the lattice isomorphism problem
Title not available (Why is that?)
Title not available (Why is that?)
Complexity and algorithms for computing Voronoi cells of lattices
The Subgroup Algorithm for Generating Uniform Random Variables
Revisiting the Gentry-Szydlo Algorithm
Graph isomorphism in quasipolynomial time (extended abstract)
A reverse Minkowski theorem
On the Lattice Isomorphism Problem
A decade of lattice cryptography
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
Solving the shortest vector problem in \(2^n\) time using discrete Gaussian sampling (extended abstract)
Title not available (Why is that?)
Title not available (Why is that?)
A canonical form for positive definite matrices
A quantum algorithm for computing the unit group of an arbitrary degree number field
Lattices with symmetry
Finding shortest lattice vectors in the presence of gaps
Search-to-decision reductions for lattice problems with approximation factors (slightly) greater than one
A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP
Slide reduction, revisited -- filling the gaps in SVP approximation
Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
Cryptography and Coding
On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice
\textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
Hull attacks on the lattice isomorphism problem
Title not available (Why is that?)

This page was built for publication: Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604873)