摘要
Luby and Rackoff idealized DES by replacing each round function with one large random function. In this paper, the author idealizes Camellia by replacing each S-box with one small random function, which is named Camellialike scheme. It is then proved that five-round Camellia-like scheme is pseudorandom and eight-round Camellia-like scheme is super-pseudorandom for adaptive adversaries. Further the paper considers more efficient construction of Camellia-like scheme, and discusses how to construct pseudorandom Camellia-like scheme from less random functions.
Luby and Rackoff idealized DES by replacing each round function with one large random function. In this paper, the author idealizes Camellia by replacing each S-box with one small random function, which is named Camellialike scheme. It is then proved that five-round Camellia-like scheme is pseudorandom and eight-round Camellia-like scheme is super-pseudorandom for adaptive adversaries. Further the paper considers more efficient construction of Camellia-like scheme, and discusses how to construct pseudorandom Camellia-like scheme from less random functions.
基金
Supported partially by the National Natural Science Foundation of China under Grants No, 60373047 and No, 90304007
the National Basic Research 973 Program of China under Grant No. 2004CB318004
the National High-Technology Development 863 Program of China under Grant No. 2003AA144030.
作者简介
E-mail： wwl@is.iscas.ac.cn Wen-Ling Wu is now a professor and Ph.D. supervisor at the State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences. She received her B.S. and M.S. degrees in maths from Northwest University in 1987 and 1990, respectively. She received her Ph.D. degree in cryptography from Xidian University in 1997.From 1998 to 1999 she was a postdoctoral fellow in the Institute of Software, Chinese Academy of Sciences. Her current research interests include theory of cryptography, mode of operation, block cipher, stream cipher and hash function.
