The irreducible vectors of a lattice: some theory and applications
From MaRDI portal
Publication:2698346
DOI10.1007/s10623-022-01119-yOpenAlexW4306696806WikidataQ114849611 ScholiaQ114849611MaRDI QIDQ2698346
Thijs Laarhoven, Benne de Weger, Emmanouil Doulgerakis
Publication date: 21 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01119-y
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Minima of forms (11H50) Lattices (06B99)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Factoring polynomials with rational coefficients
- A characterization of root lattices
- Sieving for closest lattice vectors (with preprocessing)
- The randomized slicer for CVPP: sharper, faster, smaller, batchier
- The general sieve kernel and new records in lattice reduction
- Finding closest lattice vectors using approximate Voronoi cells
- Independent sets in regular graphs
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
- Tuple lattice sieving
- BKZ 2.0: Better Lattice Security Estimates
- Sieve algorithms for the shortest vector problem are practical
- Lattice Enumeration Using Extreme Pruning
- Finding the Closest Lattice Point by Iterative Slicing
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
- Error Detecting and Error Correcting Codes
- Closest point search in lattices
- Computing the Voronoi cell of a lattice: the diamond-cutting algorithm
- Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing
- On compact representations of Voronoi cells of lattices
- On cliques in graphs
This page was built for publication: The irreducible vectors of a lattice: some theory and applications
