Beyond-birthday secure domain-preserving PRFs from a single permutation

作者：Guo, Chun; Shen, Yaobin; Wang, Lei^*; Gu, Dawu

来源：Designs, Codes and Cryptography, 2019, 87(6): 1297-1322.

DOI：10.1007/s10623-018-0528-8

• PRP-to-PRF
• Beyond birthday bound
• Domain preserving

This paper revisits the fundamental cryptographic problem of building pseudorandom functions (PRFs) from pseudorandom permutations (PRPs). We prove that, SUMPIP, i.e. P circle plus P-1, the sum of a PRP and its inverse, and EDMDSP, the single-permutation variant of the dual of the Encrypted Davies-Meyer scheme introduced by Mennink and Neves (CRYPTO 2017), are secure PRFs up to 22n/3/n adversarial queries. To our best knowledge, SUMPIP is the first parallelizable, single-permutation-based, domain-preserving, beyond-birthday secure PRP-to-PRF conversion method.

• 出版日期2019-6
• 单位上海交通大学