Paper 2026/1945
Parallel Kac’s Walk Generates PRU
, Rice University, National University of Singapore, Portland State University, Nanjing University, Hefei National Laboratory, Nanjing UniversityAbstract
Ma and Huang recently proved that the PFC construction, introduced by Metger, Poremba, Sinha and Yuen [MPSY24], gives an adaptive-secure pseudorandom unitary family PRU. Their proof developed a new path recording technique [MH25]. In this work, we show that a linear number of sequential repetitions of the parallel Kac's Walk, introduced by Lu, Qin, Song, Yao and Zhao [LQS+26], also forms an adaptive-secure PRU, confirming a conjecture therein. Moreover, it additionally satisfies strong security against adversaries making inverse queries. This gives an alternative PRU construction, and provides another instance demonstrating the power of the path recording technique. We also discuss some further simplifications and implications.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- A major revision of an IACR publication in ASIACRYPT 2026
- Keywords
- Kac's walkPseudorandom unitary operators
- Contact author(s)
-
cl308 @ rice edu
mlqin6 @ gmail com
fang song @ pdx edu
phyao1985 @ gmail com
mingnanzh @ gmail com - History
- 2026-09-13: approved
- 2026-09-09: received
- See all versions
- Short URL
- https://ia.cr/2026/1945
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/1945,
author = {Chuhan Lu and Minglong Qin and Fang Song and Penghui Yao and Mingnan Zhao},
title = {Parallel Kac’s Walk Generates {PRU}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1945},
year = {2026},
url = {https://eprint.iacr.org/2026/1945}
}
