recursive diffusion layers for (lightweight) block ciphers and hash functions

ISCAS OpenIR

	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
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	355-371
会议日期	August 15, 2012 - August 16, 2012
会议地点	Windsor, ON, Canada
收录类别	EI
ISSN	0302-9743
ISBN	9783642359989
部门归属	(1) Institute of Software Chinese Academy of Sciences P.O. Box 8718 Beijing 100190 China; (2) Graduate School of Chinese Academy of Sciences Beijing 100190 China; (3) State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China
摘要	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.
关键词	Hardware Hash Functions Linear Transformations Lyapunov Methods Matrix Algebra Photons Security Of Data Shift Registers
主办者	Department of Electrical and Computer Engineering; Faculty of Engineering; Office of Vice President - Research, University of Windsor
语种	英语
内容类型	会议论文
URI标识	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],2013:355-371.