Improved lower bound for the complexity of unique shortest vector problem
Abstract Unique shortest vector problem (uSVP) plays an important role in lattice based cryptography. Many cryptographic schemes based their security on it. For the cofidence of those applications, it is essential to clarify the complexity of uSVP with different parameters. However, proving the NP-h...
Сохранить в:
| Главные авторы: | , |
|---|---|
| Формат: | Artigo |
| Язык: | Inglês |
| Опубликовано: |
SpringerOpen
2023-11-01
|
| Серии: | Cybersecurity |
| Предметы: | |
| Online-ссылка: | https://doi.org/10.1186/s42400-023-00173-w |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|