Short integer solution problem

Short integer solution (SIS) and ring-SIS problems are two average-case problems that are used in <a href="/facts/Lattice-based_cryptography/66HyNf1P">lattice-based cryptography</a> constructions. Lattice-based cryptography began in 1996 from a seminal work by <a href="/facts/Mikl%25C3%25B3s_Ajtai/xwP2qpPq">Miklós Ajtai</a> who presented a family of one-way functions based on SIS problem. He showed that it is secure in an average case if the <a href="/facts/Shortest_vector_problem/YHXNNrrG">shortest vector problem</a> 
 
 
 
 
 
 S
 V
 P
 
 
 γ
 
 
 
 
 {\displaystyle \mathrm {SVP} _{\gamma }}
 
 (where 
 
 
 
 γ
 =
 
 n
 
 c
 
 
 
 
 {\displaystyle \gamma =n^{c}}
 
 for some constant 
 
 
 
 c
 >
 0
 
 
 {\displaystyle c>0}
 
) is hard in a worst-case scenario.
Average case problems are the problems that are hard to be solved for some randomly selected instances. For cryptography applications, worst case complexity is not sufficient, and we need to guarantee cryptographic construction are hard based on average case complexity.

Short integer solution problem open-in-new

Short integer solution problem