Indifferentiability
The indifferentiability framework for showing an idealized construction is as good as the random object it is meant to instantiate.
| Status | Problem | Tags |
|---|---|---|
|
6-round Feistel indifferentiability Whether 6-round Feistel is fully indifferentiable from a random permutation is open, bridging the proven \(r=5\) attack and the proven \(r\ge 8\) construction. 2 open |
Feistel NetworksIndifferentiabilityPseudorandom Permutationsothertight-bound | |
|
Salt Length vs. Call Count Fully open in both directions: no construction with \(O(\lambda)\)-length, message-independent salts and \(O(1)\) Merkle-Damgård calls is known, and no proof that none can exist, nor any trade-off between the two, has been given either. 4 open |
IndifferentiabilityRandom Oracle Modelromcharacterization | |
|
Short-Salt MD Combiner Security Open in both directions: the source’s Theorem 3.1 proves security only when salts exceed the message by at least the security parameter, and reports neither an attack nor a security proof once the salts shrink to a constant number of blocks. 4 open |
IndifferentiabilityRandom Oracle Modelromcharacterizationadaptation (ai) |
No matching items