Paper 2025/1857

On the Quantum Equivalence between S|LWE⟩ and ISIS

Paul Hermouet, French Institute for Research in Computer Science and Automation

Abstract

Chen, Liu, and Zhandry [CLZ22] introduced the problems S|LWE⟩ and C|LWE⟩ as quantum analogues of the Learning with Errors problem, designed to construct quantum algorithms for the Inhomogeneous Short Integer Solution (ISIS) problem. Several later works have used this framework for constructing new quantum algorithms in specific cases. However, the general relation between all these problems is still unknown. In this paper, we investigate the equivalence between S|LWE⟩ and ISIS. We present the first fully generic reduction from ISIS to S|LWE⟩, valid even in the presence of errors in the underlying algorithms. We then explore the reverse direction, introducing an inhomogeneous variant of C|LWE⟩, denoted IC|LWE⟩, and show that IC|LWE⟩ reduces to S|LWE⟩. Finally, we prove that, under certain recoverability conditions, an algorithm for ISIS can be transformed into one for S|LWE⟩. We instantiate this reverse reduction by tweaking a known algorithm for (I)SIS∞ in order to construct quantum algorithm for S|LWE⟩ when the alphabet size q is a small power of 2, recovering some results of Bai et al. [BJK+ 25]. Our results thus clarify the landscape of reductions between S|LWE⟩ and ISIS, and we show both their strong connection as well as the remaining barriers for showing full equivalence.

Note: journal version

@misc{cryptoeprint:2025/1857,
      author = {André Chailloux and Paul Hermouet},
      title = {On the Quantum Equivalence between S|{LWE}⟩ and {ISIS}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/1857},
      year = {2025},
      url = {https://eprint.iacr.org/2025/1857}
}