On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401)
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 6992088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On basing search SIVP on \(\mathbf{NP}\)-hardness |
scientific article; zbMATH DE number 6992088 |
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
0.833721399307251
0 references
0.798535943031311
0 references
0.7905140519142151
0 references
0.7881760597229004
0 references
0.7814032435417175
0 references
