Pseudorandomness of Optimal MISTY-Type Structure

Luby M and Rackoff C. How to construct pseudorandom permutations from pseudorandom functions[J].SIAM Journal on Computing.1988,17(2):373-386[2]Naor M and Reingold O. On the construction of pseudorandom permutations: Luby-Rackoff revisited[J].Journal of Cryptology.1999, 12(1):29-66[3]Sakurai K and Zheng Y. On non-pseudorandomness from block ciphers with provable immunity against linear cryptanalysis. IEICE Trans. Fundamentals, 1997, E80-A(1): 19-24.[4]Kang J S, Yi O, and Hong D, et al.. Pseudorandomness of MISTY-TYPE transformations and the block cipher KASUMI. Information Security and Privacy, 6th Australasian Conference，Sydney 2001, LNCS 2119, Berlin Heidelberg Springer- Verlag 2001: 60-73.[5]Carter L and Wegman M. Universal hash functions[J].Journal of Computer and System Sciences.1979, 18:143-152[6]Matsui M. New permutation of block ciphers with provable security against differential and linear cryptanalysis, Fast software encryption, 1996, LNCS 1039, Cambridge, UK: Springer-Verlag, 205-218.