cube cryptanalysis of lblock with noisy leakage

ISCAS OpenIR

	cube cryptanalysis of lblock with noisy leakage
	Li Zhenqi; Zhang Bin; Yao Yuan; Lin Dongdai
	2013
Conference Name	15th International Conference on Information Security and Cryptology, ICISC 2012
Source	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages	141-155
Conference Date	November 28, 2012 - November 30, 2012
Conference Place	Seoul, Korea, Republic of
Indexed Type	EI
ISSN	0302-9743
ISBN	9783642376818
Department	(1) Institute of Software Chinese Academy of Sciences Beijing China; (2) SKLOIS Institute of Information Engineering Chinese Academy of Sciences Beijing China
English Abstract	In this paper, we present some side channel cube attacks on LBlock, a lightweight block cipher proposed at ACNS 2011. It is shown that in the single bit leakage model, 14 bits of the secret key can be recovered with 2 ^10.7 time and 2^7.6 chosen plaintexts, captured the 44th state bit of the third round. In the Hamming weight leakage model, the full 80-bit key can be retrieved with only 2¹⁰ 32-round LBlock encryptions and 2^11.1 chosen plaintexts, given the leakage of the second least significant bit (LSB) of the Hamming weight after the third round. We also provide a rigorous analysis on the error tolerance probabilities of our attacks and show that the full 80-bit key can be restored in 2³⁰ 32-round LBlock encryptions with 2^8.5 chosen plaintexts and at most 5.5% of the noisy leaked bits in the LSB of the Hamming weight after the second round. Many of the ideas in our attacks are applicable to other block ciphers as well. © 2013 Springer-Verlag.; In this paper, we present some side channel cube attacks on LBlock, a lightweight block cipher proposed at ACNS 2011. It is shown that in the single bit leakage model, 14 bits of the secret key can be recovered with 2 ^10.7 time and 2^7.6 chosen plaintexts, captured the 44th state bit of the third round. In the Hamming weight leakage model, the full 80-bit key can be retrieved with only 2¹⁰ 32-round LBlock encryptions and 2^11.1 chosen plaintexts, given the leakage of the second least significant bit (LSB) of the Hamming weight after the third round. We also provide a rigorous analysis on the error tolerance probabilities of our attacks and show that the full 80-bit key can be restored in 2³⁰ 32-round LBlock encryptions with 2^8.5 chosen plaintexts and at most 5.5% of the noisy leaked bits in the LSB of the Hamming weight after the second round. Many of the ideas in our attacks are applicable to other block ciphers as well. © 2013 Springer-Verlag.
Keyword	Geometry Security Of Data
Language	英语
Content Type	会议论文
URI	http://ir.iscas.ac.cn/handle/311060/15975
Collection	中国科学院软件研究所
Recommended Citation GB/T 7714	Li Zhenqi,Zhang Bin,Yao Yuan,et al. cube cryptanalysis of lblock with noisy leakage[C],2013:141-155.

Files in This Item:
There are no files associated with this item.

If you have any objections to this item, please fill out the form below and the administrator will contact you as soon as possible.
Content:
Email：	*
Institution:
Verification Code:	Refresh

Any comments and suggestions are welcomed.
Title:	*
Content:
Email：	*
Verification Code:	Refresh

中国科学院软件研究所机构知识库