Pseudorandomness of Camellia-Like Scheme  

作　　者：吴文玲 

机构地区：[1]State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences Beijing 100080, P.R. China

出　　处：《Journal of Computer Science & Technology》2006年第1期82-88,共7页计算机科学技术学报（英文版）

基　　金：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.

摘　　要：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.

关 键 词：block cipher CAMELLIA random function PSEUDORANDOMNESS super-pseudorandomness 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]