Finding closest lattice vectors using approximate Voronoi cells (Q2302118)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7173854
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding closest lattice vectors using approximate Voronoi cells |
scientific article; zbMATH DE number 7173854 |
Statements
Finding closest lattice vectors using approximate Voronoi cells (English)
0 references
25 February 2020
0 references
lattices
0 references
preprocessing
0 references
Voronoi cells
0 references
sieving algorithms
0 references
Shortest Vector problem (SVP)
0 references
Closest Vector problem (CVP)
0 references
0.8995596170425415
0 references
0.8647109270095825
0 references
0.8394342660903931
0 references
0.8353996276855469
0 references
0.8248153924942017
0 references
