Solving the shortest vector problem in lattices faster using quantum search (Q4928590)
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 6176353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the shortest vector problem in lattices faster using quantum search |
scientific article; zbMATH DE number 6176353 |
Statements
Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search (English)
0 references
14 June 2013
0 references
lattices
0 references
shortest vector problem
0 references
sieving
0 references
quantum algorithms
0 references
quantum search
0 references
0.9728188514709472
0 references
0.8533608317375183
0 references
0.8506748676300049
0 references
0.8363612294197083
0 references
0.7908053398132324
0 references
