Farasha: a provable permutation-based parallelizable PRF

DOI10.1007/978-3-031-58411-4_20MaRDI QIDQ6619859zbMATH OpenFDO

Authors Najwa Aaraj, Emanuele Bellini, Ravindra Jejurikar, Marc Manzano, Raghvendra Singh Rohit, Eugenio Salazar

Publication date 16 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-58411-4_20

zbMATH Keywords

\textsf{Farfalle}almost xor universal functionpseudo random function

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the security of keyed hashing based on public permutations
• Tight security analysis of the public permutation-based \(\mathsf{PMAC\_Plus} \)
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• Algebraic key-recovery attacks on reduced-round Xoofff
• How to build pseudorandom functions from public random permutations

Cites work

• \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
• A construction of a cipher from a single pseudorandom permutation.
• A General Construction of Tweakable Block Ciphers and Different Modes of Operations
• A Provable-Security Treatment of the Key-Wrap Problem
• Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers
• Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
• Duplexing the sponge: Single-pass authenticated encryption and other applications
• scientific article; zbMATH DE number 2086719 (Why is no real title available?)
• Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
• Minimalism in cryptography: the Even-Mansour scheme revisited
• Multi-key security: the Even-Mansour construction revisited
• NORX: Parallel and scalable AEAD
• Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions
• Quark: a lightweight hash
• Sponge-based pseudo-random number generators
• The PHOTON family of lightweight hash functions
• The software performance of authenticated-encryption modes
• The “Coefficients H” Technique

Cited in

(2)

• On the security of keyed hashing based on public permutations
• Forking sums of permutations for highly secure and efficient PRFs

This page was built for publication: Farasha: a provable permutation-based parallelizable PRF

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