cryptanalysis of the lane hash function

	cryptanalysis of the lane hash function
	Wu Shuang ; Feng Dengguo ; Wu Wenling
	2009
会议名称	16th Annual International Workshop on Selected Areas Cryptography
会议日期	AUG 13-14,
会议地点	Calgary, CANADA
关键词	hash function collision attack rebound attack LANE SHA-3 candidates
英文摘要	The LANE4 hash function is designed by Sebastiaan In-desteege and Bart Preneel. It is now a first round candidate of NISTs SHA-3 competition. The LANE hash function contains four concrete designs with different digest length of 224, 256, 384 and 512. The LANE hash function uses two permutations P and Q, which consist of different number of AES1-like rounds. LANE-224/256 uses 6-round P and 3-round Q. LANE-384/512 uses 8-round P and 4-round Q. We will use LANE-n-(a,b) to denote a. variant of LANE with a-round P, b-round Q and a digest length n. We have found a semi-free start collision attack on reduced-round LANE-256-(3,3) with complexity of 2(62) compression function evaluations and 2(69) memory. This technique call be applied to LANE-512-(3,4) to get a semi-free start collision attack with the same complexity of 2(62) and 2(69) memory. We also propose a collision attack on LANE-512-(3,4) with complexity of 2(94) and 2(133) memory.
会议主办者	Int Assoc Cryptol Res
会议录	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
会议录出版者	SELECTED AREAS IN CRYPTOGRAPHY
会议录出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
ISSN号	0302-9743
ISBN号	978-3-642-05443-3
内容类型	会议论文
源URL	[http://124.16.136.157/handle/311060/8216]
专题	软件研究所_信息安全国家重点实验室_会议论文
推荐引用方式 GB/T 7714	Wu Shuang,Feng Dengguo,Wu Wenling. cryptanalysis of the lane hash function[C]. 见:16th Annual International Workshop on Selected Areas Cryptography. Calgary, CANADA. AUG 13-14,.