The Generalized Short Integer Solution Problem is a computational lattice problem in post-quantum cryptography that generalizes the Short Integer Solution Problem by extending the constraint on solution vectors to encompass more complex modular structures and matrix classes, thereby capturing a broader range of hardness assumptions under lattice reduction attacks.
3
Publications
56
Citations
8
Authors
7
Institutions
Publications per year
2017–2026
1
Variants
Generalized Sis ProblemGsis
Parents
Publications
3
1–3 of 3
Authors
8
- SDSteven D. Galbraith⋆
Royal Holloway University of London, United Kingdom
1 publications · 15 citations
1
h-index
- ZL
1
h-index
- DS
1
h-index
- ZB
1
h-index
- VVVinod Vaikuntanathan
Massachusetts Institute of Technology, United States
1 publications · 26 citations
1
h-index
1–5 of 8
Institutions
7
New York University
New York, United States
1 h-index
1 publications
15 citations
Florida Atlantic University
Boca Raton, United States
1 h-index
1 publications
15 citations
Peking University
Beijing, China
1 h-index
1 publications
15 citations
Weizmann Institute of Science
Rehovot, Israel
1 h-index
1 publications
26 citations
Beihang University
Beijing, China
1 h-index
2 publications
30 citations
University of Auckland
Auckland, New Zealand
1 h-index
2 publications
30 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
1 publications
26 citations
1–7 of 7
Venues
- Computers & Electrical Engineering
1 publications · 15 citations
1
h-index
- IACR Cryptology ePrint Archive
Repository · 1 publications · 26 citations
1
h-index
- Journal of Cryptology
1 publications · 15 citations
1
h-index
1–3