Dual lattice attacks for closest vector problems (with preprocessing) (Q826277)
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 7449889
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dual lattice attacks for closest vector problems (with preprocessing) |
scientific article; zbMATH DE number 7449889 |
Statements
Dual lattice attacks for closest vector problems (with preprocessing) (English)
0 references
20 December 2021
0 references
lattice-based cryptography
0 references
lattice algorithms
0 references
primal/dual attacks
0 references
closest vector problem (CVP)
0 references
bounded distance decoding (BDD)
0 references
0 references
0.8361199498176575
0 references
0.8247979283332825
0 references
0.796047568321228
0 references
0.7661585211753845
0 references
0.764186680316925
0 references
