Keyed sum of permutations: a simpler RP-based PRF

DOI10.1007/978-3-031-30872-7_22MaRDI QIDQ6057195zbMATH OpenOpenAlexFDO

Authors Ferdinand Sibleyras, Yosuke Todo

Publication date 4 October 2023

Published in Topics in Cryptology – CT-RSA 2023 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30872-7_22

zbMATH Keywords

provable securitybeyond-birthday-boundRP-to-PRFSoEMKSoP

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60)

Recommendations

• How to build pseudorandom functions from public random permutations
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• The sum of PRPs is a secure PRF
• scientific article; zbMATH DE number 1302860
• Pseudorandom functions and permutations provably secure against related-key attacks

Cites work

• scientific article; zbMATH DE number 177029 (Why is no real title available?)
• scientific article; zbMATH DE number 1303128 (Why is no real title available?)
• scientific article; zbMATH DE number 697813 (Why is no real title available?)
• 10-round Feistel is indifferentiable from an ideal cipher
• Breaking and repairing GCM security proofs
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• Full indifferentiable security of the XOR of two or more random permutations using the ^2 method
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• How to build an ideal cipher: the indifferentiability of the Feistel construction
• How to build pseudorandom functions from public random permutations
• Indifferentiability of 8-Round Feistel Networks
• Key-alternating ciphers in a provable setting: encryption using a small number of public permutations. (Extended abstract)
• Minimalism in cryptography: the Even-Mansour scheme revisited
• Minimizing the two-round Even-Mansour cipher
• On the XOR of multiple random permutations
• Quantum attacks on sum of Even-Mansour pseudorandom functions
• Security analysis of key-alternating Feistel ciphers
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• The indistinguishability of the XOR of k permutations
• The “Coefficients H” Technique
• Tight security bounds for key-alternating ciphers

Cited in

(6)

• A Simple Variant of the Merkle-Damgård Scheme with a Permutation
• The sum of PRPs is a secure PRF
• A simple variant of the Merkle-Damgård scheme with a permutation
• On the number of restricted solutions to constrained systems and their applications
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• How to build pseudorandom functions from public random permutations

This page was built for publication: Keyed sum of permutations: a simpler RP-based PRF

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6057195)