On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On basing search SIVP on \(\mathbf{NP}\)-hardness |
scientific article |
Statements
On basing search SIVP on \(\mathbf{NP}\)-hardness (English)
0 references
11 December 2018
0 references
complexity-theoretic cryptography
0 references
approximate shortest independent vector problem (SIVP)
0 references
0 references
