How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
New Results on Pseudorandom Permutation Generators Based on the DES Scheme
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
The security of many-round Luby-Rackoff pseudo-random permutations
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Automated design of a lightweight block cipher with Genetic Programming
International Journal of Knowledge-based and Intelligent Engineering Systems - Genetic Programming An Emerging Engineering Tool
| Hi-index | 0.00 |
In this paper we will prove the Conjecture 8.1. of [7]. We call it “Conjecture Pi⊕Pj ”. It is a purely combinatorial conjecture that has however some cryptographic consequence. For example, from this result we can improve the proven security bounds on random Feistel schemes with 5 rounds: we will prove that no adaptive chosen plaintext/chosen ciphertext attack can exist on 5 rounds Random Feistel Schemes when m≪2n. This result reach the optimal bound of security against an adversary with unlimited computing power (but limited by m queries) with the minimum number of rounds. It solves the last case of a famous open problem (cf [8]). An extended version of this paper is available from the author.