Logarithmic-Depth Pseudorandom Functions from Well-Founded Code-Based Assumptions
Youlong Ding
·
2026-02-14
·
via Cryptology ePrint Archive
We give the first $\mathsf{NC}^1$-computable Pseudorandom Function (PRF) constructions from well-founded (non…
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。