Wagner's algorithm provably runs in subexponential time for \(\mathrm{SIS}^\infty \) (Q6864043)
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 8154764
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Wagner's algorithm provably runs in subexponential time for \(\mathrm{SIS}^\infty \) |
scientific article; zbMATH DE number 8154764 |
Statements
Wagner's algorithm provably runs in subexponential time for \(\mathrm{SIS}^\infty \) (English)
0 references
4 February 2026
0 references
Wagner's algorithm
0 references
discrete Gaussian sampling
0 references
short integer solution problem (SIS)
0 references
lattice-based cryptography
0 references
cryptanalysis
0 references
0 references
0 references
0 references
