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

Authors

45

  1. MT
    Miaomiao Tian

    University of Science and Technology of China, China

    3 publications · 46 citations

    3

    h-index

  2. LH
    Liusheng Huang

    University of Science and Technology of China, China

    3 publications · 46 citations

    3

    h-index

  3. SH
    Sen‐Shan Huang

    National Changhua University of Education, Taiwan

    2 publications · 32 citations

    2

    h-index

  4. DD
    Dharminder Dharminder

    LNM Institute of Information Technology, India

    2 publications · 66 citations

    2

    h-index

  5. WS
    Willy Susilo

    University of Wollongong, Australia

    1 publications · 15 citations

    2

    h-index

1–5 of 45

Venues

  1. IEEE Access

    4 publications · 276 citations

    5

    h-index

  2. 2

    h-index

  3. Fundamenta Informaticae

    1 publications · 13 citations

    1

    h-index

  4. Security and Communication Networks

    1 publications · 18 citations

    1

    h-index

  5. The Computer Journal

    1 publications · 18 citations

    1

    h-index

1–5