On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
From MaRDI portal
Publication:2170105
DOI10.1007/978-3-031-07082-2_23zbMath1502.94033OpenAlexW3203934452MaRDI QIDQ2170105
Wessel P. J. van Woerden, Léo Ducas
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-07082-2_23
Related Items (6)
Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ Hull attacks on the lattice isomorphism problem ⋮ Hardness estimates of the code equivalence problem in the rank metric ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ Fast Falcon signature generation and verification using ARMv8 NEON instructions ⋮ Compact lattice gadget and its applications to hash-and-sign signatures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hierarchy of polynomial time lattice basis reduction algorithms
- Factoring polynomials with rational coefficients
- Computing isometries of lattices
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- On the Chor-Rivest knapsack cryptosystem
- Revisiting the Gentry-Szydlo Algorithm
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- Lossy Trapdoor Functions and Their Applications
- Trapdoors for hard lattices and new cryptographic constructions
- An Efficient and Parallel Gaussian Sampler for Lattices
- Constructing integral lattices with prescribed minimum. I
- A knapsack-type public key cryptosystem based on arithmetic in finite fields
- A Pseudorandom Generator from any One-way Function
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Finding the permutation between equivalent linear codes: the support splitting algorithm
- New directions in nearest neighbor searching with applications to lattice sieving
- Lattice (List) Decoding Near Minkowski’s Inequality
- Lattice Attacks on NTRU and LWE: A History of Refinements
- LESS is More: Code-Based Signatures Without Syndromes
- On the Bounded Distance Decoding Problem for Lattices Constructed and Their Cryptographic Applications
- Introduction to Modern Cryptography
- Leftover Hash Lemma, Revisited
- On the Lattice Isomorphism Problem
- On the Lattice Isomorphism Problem
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Classical hardness of learning with errors
- A canonical form for positive definite matrices
- Hiding information and signatures in trapdoor knapsacks
- Theory of Cryptography
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography
