The closest vector problem in tensored root lattices of type A and in their duals
DOI10.1007/s10623-017-0332-xzbMath1381.11057OpenAlexW2583468640MaRDI QIDQ1692156
Léo Ducas, Wessel P. J. van Woerden
Publication date: 26 January 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/25527
closest vector problemmaximum likelihood decodingcyclotomic latticeslattice based cryptographytensored root lattices
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Relations with coding theory (11H71)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- On Lovász' lattice reduction and the nearest lattice point problem
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Algebraic Number Theory and Code Design for Rayleigh Fading Channels
- On Ideal Lattices and Learning with Errors over Rings
- An Algorithm to Compute the Nearest Point in the Lattice $A_{n}^*$
- Voronoi regions of lattices, second moments of polytopes, and quantization
- Fast quantizing and decoding and algorithms for lattice quantizers and codes
- A Toolkit for Ring-LWE Cryptography
- Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing
This page was built for publication: The closest vector problem in tensored root lattices of type A and in their duals