On Linear Systems of Equations with Distinct Variables and Small Block Size
- 1k Downloads
In this paper we will prove the Conjecture 8.1. of . We call it “Conjecture P i ⊕P j ”. 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≪2 n . 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 ).
An extended version of this paper is available from the author.
Unable to display preview. Download preview PDF.
- 3.Maurer, U.: A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 239–255. Springer, Heidelberg (1993)Google Scholar
- 6.Patarin, J.: New results on pseudorandom permutation generators based on the DES scheme. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 301–312. Springer, Heidelberg (1992)Google Scholar