Pseudorandomness of Knapsacks over a Number Ring

Biswajit Mandal; Shashank Singh

Paper 2026/270

Pseudorandomness of Knapsacks over a Number Ring

Biswajit Mandal, Indian Institute of Science Education and Research, Bhopal

Shashank Singh

, Indian Institute of Science Education and Research, Bhopal

Abstract

In this work, we study the pseudorandomness of the bounded Knapsack function family defined over a number ring ${R}$. We establish that if the Knapsack function family is one-way and certain related folded Knapsack function families are pseudorandom, then the original Knapsack is pseudorandom. This can be seen as a generalisation of the work of Micciancio and Mol presented at the CRYPTO-2011, for the case of Knapsack function families defined over arbitrary number ring.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
Keywords: Pseudorandomness Knapsack Unpredictability
Contact author(s): biswajit22 @ iiserb ac in
shashank @ iiserb ac in
History: 2026-02-17: approved; 2026-02-16: received; See all versions
Short URL: https://ia.cr/2026/270
License: CC BY

BibTeX

@misc{cryptoeprint:2026/270,
      author = {Biswajit Mandal and Shashank Singh},
      title = {Pseudorandomness of Knapsacks over a Number Ring},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/270},
      year = {2026},
      url = {https://eprint.iacr.org/2026/270}
}