recursive diffusion layers for (lightweight) block ciphers and hash functions
文献类型:会议论文
作者 | Wu Shengbao ; Wang Mingsheng ; Wu Wenling |
出版日期 | 2013 |
会议名称 | 19th International Conference on Selected Areas in Cryptography, SAC 2012 |
会议日期 | August 15, 2012 - August 16, 2012 |
会议地点 | Windsor, ON, Canada |
关键词 | Hardware Hash functions Linear transformations Lyapunov methods Matrix algebra Photons Security of data Shift registers |
页码 | 355-371 |
中文摘要 | Diffusion layers with maximum branch numbers are widely used in block ciphers and hash functions. In this paper, we construct recursive diffusion layers using Linear Feedback Shift Registers (LFSRs). Unlike the MDS matrix used in AES, whose elements are limited in a finite field, a diffusion layer in this paper is a square matrix composed of linear transformations over a vector space. Perfect diffusion layers with branch numbers from 5 to 9 are constructed. On the one hand, we revisit the design strategy of PHOTON lightweight hash family and the work of FSE 2012, in which perfect diffusion layers are constructed by one bundle-based LFSR. We get better results and they can be used to replace those of PHOTON to gain smaller hardware implementations. On the other hand, we investigate new strategies to construct perfect diffusion layers using more than one bundle-based LFSRs. Finally, we construct perfect diffusion layers by increasing the number of iterations and using bit-level LFSRs. Since most of our proposals have lightweight examples corresponding to 4-bit and 8-bit Sboxes, we expect that they will be useful in designing (lightweight) block ciphers and (lightweight) hash functions. © 2013 Springer-Verlag Berlin Heidelberg. |
英文摘要 | Diffusion layers with maximum branch numbers are widely used in block ciphers and hash functions. In this paper, we construct recursive diffusion layers using Linear Feedback Shift Registers (LFSRs). Unlike the MDS matrix used in AES, whose elements are limited in a finite field, a diffusion layer in this paper is a square matrix composed of linear transformations over a vector space. Perfect diffusion layers with branch numbers from 5 to 9 are constructed. On the one hand, we revisit the design strategy of PHOTON lightweight hash family and the work of FSE 2012, in which perfect diffusion layers are constructed by one bundle-based LFSR. We get better results and they can be used to replace those of PHOTON to gain smaller hardware implementations. On the other hand, we investigate new strategies to construct perfect diffusion layers using more than one bundle-based LFSRs. Finally, we construct perfect diffusion layers by increasing the number of iterations and using bit-level LFSRs. Since most of our proposals have lightweight examples corresponding to 4-bit and 8-bit Sboxes, we expect that they will be useful in designing (lightweight) block ciphers and (lightweight) hash functions. © 2013 Springer-Verlag Berlin Heidelberg. |
收录类别 | EI |
会议主办者 | Department of Electrical and Computer Engineering; Faculty of Engineering; Office of Vice President - Research, University of Windsor |
会议录 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
![]() |
语种 | 英语 |
ISSN号 | 0302-9743 |
ISBN号 | 9783642359989 |
源URL | [http://ir.iscas.ac.cn/handle/311060/15899] ![]() |
专题 | 软件研究所_软件所图书馆_会议论文 |
推荐引用方式 GB/T 7714 | Wu Shengbao,Wang Mingsheng,Wu Wenling. recursive diffusion layers for (lightweight) block ciphers and hash functions[C]. 见:19th International Conference on Selected Areas in Cryptography, SAC 2012. Windsor, ON, Canada. August 15, 2012 - August 16, 2012. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。