Ryan O'Donnell: Pseudorandom Permutations from Random Reversible Circuits

Описание к видео Ryan O'Donnell: Pseudorandom Permutations from Random Reversible Circuits

Abstract: An extremely simple way to construct a pseudorandom permutation on {0,1}^n is to make a uniformly random n-bit, size-m circuit with reversible gates (of fan-in/out 3, say). Previous work has shown that for some m = poly(n,k), this construction is statistically "almost k-wise independent". In this talk, we will explain how these results can be made more practical, showing that depth O~(k) circuits suffice. We also discuss the question: are constructions like this plausibly computationally secure pseudorandom permutations?

Joint work with William He (https://arxiv.org/abs/2404.14648)

Part of CMU Workshop on Cryptography 2024 (https://sites.google.com/andrew.cmu.e...)

Комментарии

Информация по комментариям в разработке

Похожие видео