Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls

DOI10.1007/978-3-031-30634-1_14zbMath1528.94056OpenAlexW4365807779MaRDI QIDQ6083137

Publication date: 8 December 2023

Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30634-1_14

zbMATH Keywords

indifferentiability Feistel construction ideal cipher model random oracle model

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
How to build an ideal cipher: the indifferentiability of the Feistel construction
An analysis of the blockcipher-based hash functions from PGV
On the impossibility of highly-efficient blockcipher-based hash functions
A construction of a cipher from a single pseudorandom permutation.
The size of bipartite graphs with a given girth
Indifferentiable authenticated encryption
Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient
Breaking the FF3 format-preserving encryption standard over small domains
Indifferentiability for public key cryptosystems
Indifferentiability of truncated random permutations
Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
Yoyo tricks with AES
On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes
Linicrypt: A Model for Practical Cryptography
Key-Alternating Ciphers and Key-Length Extension: Exact Bounds and Multi-user Security
Indifferentiability of 8-Round Feistel Networks
On the Indifferentiability of Key-Alternating Ciphers
How to Construct an Ideal Cipher from a Small Set of Public Permutations
Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations
An Enciphering Scheme Based on a Card Shuffle
AEGIS: A Fast Authenticated Encryption Algorithm
Careful with Composition: Limitations of the Indifferentiability Framework
The random oracle methodology, revisited
Distinguisher and Related-Key Attack on the Full AES-256
Communication Theory of Secrecy Systems*
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Resource-Restricted Indifferentiability
Known-Key Distinguishers for Some Block Ciphers
The History of Degenerate (Bipartite) Extremal Graph Problems
Merkle-Damgård Revisited: How to Construct a Hash Function
On the Indifferentiability of the Sponge Construction
Security/Efficiency Tradeoffs for Permutation-Based Hashing
Bounds on the Efficiency of Generic Cryptographic Constructions
Fast Software Encryption
10-Round Feistel is Indifferentiable from an Ideal Cipher
Indifferentiability of Confusion-Diffusion Networks
On a problem of K. Zarankiewicz
Theory of Cryptography
How to protect DES against exhaustive key search (an analysis of DESX).

This page was built for publication: Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls