Name
Abstract | ||
|---|---|---|
This paper revisits the fundamental cryptographic problem of building pseudorandom functions (PRFs) from pseudorandom permutations (PRPs). We prove that, SUMPIP, i.e. \(P \oplus 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 \(2^{2n/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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10623-018-0528-8 | Designs, Codes and Cryptography |
Keywords | Field | DocType |
PRP-to-PRF, Beyond birthday bound, Domain preserving, 94A60, 68P25 | Parallelizable manifold,Inverse,Discrete mathematics,Combinatorics,Cryptography,Permutation,Encryption,Mathematics,Pseudorandom number generator | Journal |
Volume | Issue | ISSN |
87 | 6 | 1573-7586 |
Citations | PageRank | References |
0 | 0.34 | 30 |
Authors | ||
5 | ||