Keyed Sum of Permutations: a simpler RP-based PRF

ePrint Report: Keyed Sum of Permutations: a simpler RP-based PRF

Ferdinand Sibleyras, Yosuke Todo

Idealized constructions in cryptography prove the security of a primitive based on the security of another primitive.
The challenge of building a pseudorandom function (PRF) from a random permutation (RP) has only been recently tackled by Chen, Lambooij and Mennink [CRYPTO 2019] who proposed Sum of Even-Mansour (SoEM) with a provable beyond-birthday-bound security.
In this work, we revisit the challenge of building a PRF from an …

challenge chen cryptography eprint report function prove random report security todo