pseudorandomness of camellia-like scheme
文献类型：期刊论文
| 作者 | Wu Wenling |
| 刊名 | Springer New York LLC
 |
| 出版日期 | 2006 |
| 卷号 | 21期号:1页码:82-88 |
| 关键词 | block cipher Camellia random. function pseudorandomness super-pseudorandomness CONSTRUCTION PERMUTATIONS SECURITY CIPHERS |
| 通讯作者 | Wu, WL (通讯作者), Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China |
| 收录类别 | EI,SCI |
| WOS记录号 | WOS:000235342400009 |
| 公开日期 | 2010-08-20 |
| 附注 | 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. |
| 源URL | [http://124.16.136.157/handle/311060/3486]  |
| 专题 | 软件研究所_信息安全国家重点实验室_期刊论文 |
| 推荐引用方式 GB/T 7714 | Wu Wenling. pseudorandomness of camellia-like scheme[J]. Springer New York LLC,2006,21(1):82-88. |
| APA | Wu Wenling.(2006).pseudorandomness of camellia-like scheme.Springer New York LLC,21(1),82-88. |
| MLA | Wu Wenling."pseudorandomness of camellia-like scheme".Springer New York LLC 21.1(2006):82-88. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。