Pseudorandomness of Camellia-like scheme

被引：5

作者：

Wu, WL ^{[1
]}

机构：

[1] Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China

来源：

JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY | 2006年 / 21卷 / 01期

关键词：

block cipher; Camellia; random; function; pseudorandomness; super-pseudorandomness;

D O I：

10.1007/s11390-006-0082-0

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 Camellia-like 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.

引用

页码：82 / 88

页数：7