1. Shannon C.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949).
2. Luby M., Rackoff C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373–386 (1988).
3. Goldreich O.: Modern Cryptography, Probabilistic Proofs, and Pseudorandomness. Springer, New York (1998).
4. Patarin J.: Security of random Feistel schemes with 5 or more rounds. In: Franklin M.K. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 3152, pp. 106–122. Springer, Heidelberg (2004).
5. Maurer U.M., Pietrzak K.: The security of many-round Luby–Rackoff pseudo-random permutations. In: Biham E. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 2656, pp. 544–561. Springer, Heidelberg (2003).