Forking sums of permutations for highly secure and efficient PRFs

DOI10.1007/S10623-025-01698-6MaRDI QIDQ6909168zbMATH OpenFDO

Authors Avijit Dutta, Eik List

Publication date 30 October 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-025-01698-6

zbMATH Keywords

AESforkcipherH-coefficient techniquemirror theoryprovable securitysum of permutations

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cites work

• \textsc{KangarooTwelve}: fast hashing based on \({\mathrm {KECCAK}\mathrm{-}p}{}\)
• \textsf{Elastic-Tweak}: a framework for short tweak tweakable block cipher
• A Generic Method to Design Modes of Operation Beyond the Birthday Bound
• A Meet-in-the-Middle Attack on 8-Round AES
• A new structural-differential property of 5-round AES
• Categorization of faulty nonce misuse resistant message authentication
• Communication Theory of Secrecy Systems*
• Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
• Efficient instances of docked double decker with AES, and application to authenticated encryption
• Encrypted Davies-Meyer and its dual: towards optimal security using mirror theory
• EWCDM: An Efficient, Beyond-Birthday Secure, Nonce-Misuse Resistant MAC
• Exhausting Dmirci-Selçuk meet-in-the-middle attacks against reduced-round AES
• Farasha: a provable permutation-based parallelizable PRF
• Fast Data Encipherment Algorithm FEAL
• Feistel ciphers. Security proofs and cryptanalysis
• Forkcipher: a new primitive for authenticated encryption of very short messages
• scientific article; zbMATH DE number 1302860 (Why is no real title available?)
• scientific article; zbMATH DE number 1303128 (Why is no real title available?)
• scientific article; zbMATH DE number 503258 (Why is no real title available?)
• scientific article; zbMATH DE number 1455096 (Why is no real title available?)
• scientific article; zbMATH DE number 1418257 (Why is no real title available?)
• Improved differential attacks for ECHO and Grøstl
• Improved key recovery attacks on reduced-round AES with practical data and memory complexities
• Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
• Information Security and Cryptology - ICISC 2005
• Information-theoretic indistinguishability via the chi-squared method
• Internal differential boomerangs: practical analysis of the round-reduced Keccak-f
• Mixcolumns properties and attacks on (round-reduced) AES with a single secret S-Box
• New Blockcipher Modes of Operation with Beyond the Birthday Bound Security
• Proof of Mirror Theory for ξ _max = 2
• Proof of mirror theory for a wide range of \(\xi_{\max }\)
• Provable Security Evaluation of Block Ciphers Against Demirci-Selçuk’s Meet-in-the-Middle Attack
• Proving the security of the extended summation-truncation hybrid
• Rotational cryptanalysis of ARX
• Simpira v2: a family of efficient permutations using the AES round function
• Structural evaluation by generalized integral property
• The advantage of truncated permutations
• The iterated random function problem
• The Relation Between CENC and NEMO
• The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
• The summation-truncation hybrid: reusing discarded bits for free
• Truncated boomerang attacks and application to AES-based ciphers
• Tweaks and Keys for Block Ciphers: The TWEAKEY Framework
• ZMAC: a fast tweakable block cipher mode for highly secure message authentication

This page was built for publication: Forking sums of permutations for highly secure and efficient PRFs

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