Farasha: a provable permutation-based parallelizable PRF

DOI10.1007/978-3-031-58411-4_20MaRDI QIDQ6619859

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

Publication date: 16 October 2024

zbMATH Keywords

pseudo random function\textsf{Farfalle}almost xor universal function

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• A construction of a cipher from a single pseudorandom permutation.
• \textsc{Ciminion}: symmetric encryption based on Toffoli-gates over large finite fields
• Quark: a lightweight hash
• Computational aspects of the expected differential probability of 4-round AES and AES-like ciphers
• Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
• Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
• Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications
• Minimalism in Cryptography: The Even-Mansour Scheme Revisited
• The Software Performance of Authenticated-Encryption Modes
• Multi-key Security: The Even-Mansour Construction Revisited
• Sponge-Based Pseudo-Random Number Generators
• A Provable-Security Treatment of the Key-Wrap Problem
• A General Construction of Tweakable Block Ciphers and Different Modes of Operations
• The “Coefficients H” Technique
• The PHOTON Family of Lightweight Hash Functions
• NORX: Parallel and Scalable AEAD
• Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions

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