R\'enyi divergence-based uniformity guarantees for -universal hash functions
M Pathegama, A Barg - arXiv preprint arXiv:2410.16459, 2024 - arxiv.org
Universal hash functions map the output of a source to random strings over a finite alphabet,
aiming to approximate the uniform distribution on the set of strings. A classic result on these …
aiming to approximate the uniform distribution on the set of strings. A classic result on these …
Limitations of the decoding-to-LPN reduction via code smoothing
M Pathegama, A Barg - arXiv preprint arXiv:2408.03742, 2024 - arxiv.org
The Learning Parity with Noise (LPN) problem underlies several classic cryptographic
primitives. Researchers have endeavored to demonstrate the algorithmic difficulty of this …
primitives. Researchers have endeavored to demonstrate the algorithmic difficulty of this …
Smoothing Linear Codes by R\'enyi Divergence and Applications to Security Reduction
H Yan, C Ling - arXiv preprint arXiv:2405.10124, 2024 - arxiv.org
The concept of the smoothing parameter plays a crucial role in both lattice-based and code-
based cryptography, primarily due to its effectiveness in achieving nearly uniform …
based cryptography, primarily due to its effectiveness in achieving nearly uniform …