Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search (Q4928590): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2951967430 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1301.6176 / rank | |||
Normal rank | |||
Latest revision as of 20:46, 19 April 2024
scientific article; zbMATH DE number 6176353
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
