Short Integer Solution Problem
The Short Integer Solution Problem is a computational lattice problem that requires finding a nonzero integer vector of bounded norm that maps to the zero vector under a given random linear transformation modulo a fixed integer, distinguishing it from other lattice problems by its focus on short solutions to modular linear systems.
19
Publications
783
Citations
45
Authors
30
Institutions
Publications per year
2017–2026
12
19
A Secure Cryptocurrency Scheme Based on Post-Quantum Blockchain
Gao Yu-long, Xiu‐Bo Chen, Yuling Chen et al. · IEEE Access · 2018 · 189 citations · Full text
Practical Lattice-Based Multisignature Schemes for Blockchains
Changshe Ma, Mei Jiang · IEEE Access · 2019 · 44 citations · Full text
Privacy Protection of VANET Based on Traceable Ring Signature on Ideal Lattice
Longbo Han, Suzhen Cao, Xiaodong Yang et al. · IEEE Access · 2020 · 28 citations · Full text
1–5 of 19
45
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 45
30
University of Science and Technology of China
Hefei, China
3 h-index
6 publications
95 citations
LNM Institute of Information Technology
Jaipur, India
2 h-index
3 publications
110 citations

University of Wollongong
Wollongong, Australia
2 h-index
4 publications
60 citations
National Changhua University of Education
Changhua, Taiwan
2 h-index
6 publications
96 citations

Amrita Vishwa Vidyapeetham
Coimbatore, India
2 h-index
1 publications
22 citations
Beijing Electronic Science and Technology Institute
Beijing, China
1 h-index
1 publications
189 citations
IIT@MIT
Cambridge, United States
1 h-index
2 publications
488 citations
Boston University
Boston, United States
1 h-index
1 publications
244 citations
1–8 of 30
4 publications · 276 citations
5
h-index
2 publications · 66 citations
2
h-index
1 publications · 13 citations
1
h-index
1 publications · 18 citations
1
h-index
1 publications · 18 citations
1
h-index
1–5