Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
From MaRDI portal
Publication:2118552
DOI10.1007/978-3-030-81293-5_17zbMath1485.94059arXiv2102.06344OpenAlexW3141419395MaRDI QIDQ2118552
Tamar Lichter Blanks, Stephen D. Miller
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2102.06344
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (2)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating shorter bases for hard random lattices
- Non-abelian analogs of lattice rounding
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Density of integer points on affine homogeneous varieties
- A characterization of the \(\mathbb Z^ n\) lattice
- Lattices with symmetry
- How to pick a random integer matrix? (and other questions)
- Revisiting the Gentry-Szydlo Algorithm
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Bonsai Trees, or How to Delegate a Lattice Basis
- An LLL Algorithm with Quadratic Complexity
- The Ergodic Theory of Lattice Subgroups (AM-172)
- The Behavior of Random Reduced Bases
- Testing Isomorphism of Lattices over CM-Orders
- Cryptography and Coding
This page was built for publication: Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
