中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 会议论文
Title:
the higher-order meet-in-the-middle attack and its application to the camellia block cipher (extended abstract)
Author: Lu Jiqiang ; Wei Yongzhuang ; Kim Jongsung ; Pasalic Enes
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Conference Name: 13th International Conference on Cryptology in India, INDOCRYPT 2012
Conference Date: December 9, 2012 - December 12, 2012
Issued Date: 2012
Conference Place: Kolkata, India
Keyword: Security of data
Indexed Type: EI
ISSN: 0302-9743
ISBN: 9783642349300
Department: (1) Institute for Infocomm Research Agency for Science Technology and Research 1 Fusionopolis Way #19-01 Connexis Singapore 138632 Singapore; (2) Guilin University of Electronic Technology Guilin City Guangxi Province 541004 China; (3) State Key Lab. of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China; (4) Department of E-Business Kyungnam University 449 Wolyoung-dong Masan Kyungnam Korea Republic of; (5) University of Primorska FAMNIT Koper Slovenia
Sponsorship: Defence Research and Developement Organization (D.R.D.O.); Google Inc.; Microsoft Research; National Board of Higher Mathematics (N.B.H.M.); Reserve Bank of India (R.B.I.); Tata Consultancy Services (T.C.S.)
Abstract: The meet-in-the-middle (MitM) attack is a technique for analysing the security of a block cipher. In this paper, we propose an extension of the MitM attack, which we call the higher-order meet-in-the-middle (HO-MitM) attack; the core idea of the HO-MitM attack is to use multiple plaintexts to cancel some key-dependent component(s) or parameter(s) when constructing a basic unit of "value-in-the-middle". We introduce a novel approach, which combines integral cryptanalysis with the MitM attack, to construct HO-MitM attacks on 10-round Camellia under 128 key bits, 11-round Camellia under 192 key bits and 12-round Camellia under 256 key bits, all of which include FL/FL-1 functions. Finally, we apply an existing approach to construct HO-MitM attacks on 14-round Camellia without FL/FL-1 functions under 192 key bits and 16-round Camellia without FL/FL-1 functions under 256 key bits. © Springer-Verlag 2012.
English Abstract: The meet-in-the-middle (MitM) attack is a technique for analysing the security of a block cipher. In this paper, we propose an extension of the MitM attack, which we call the higher-order meet-in-the-middle (HO-MitM) attack; the core idea of the HO-MitM attack is to use multiple plaintexts to cancel some key-dependent component(s) or parameter(s) when constructing a basic unit of "value-in-the-middle". We introduce a novel approach, which combines integral cryptanalysis with the MitM attack, to construct HO-MitM attacks on 10-round Camellia under 128 key bits, 11-round Camellia under 192 key bits and 12-round Camellia under 256 key bits, all of which include FL/FL-1 functions. Finally, we apply an existing approach to construct HO-MitM attacks on 14-round Camellia without FL/FL-1 functions under 192 key bits and 16-round Camellia without FL/FL-1 functions under 256 key bits. © Springer-Verlag 2012.
Language: 英语
Content Type: 会议论文
URI: http://ir.iscas.ac.cn/handle/311060/15815
Appears in Collections:软件所图书馆_会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Lu Jiqiang,Wei Yongzhuang,Kim Jongsung,et al. the higher-order meet-in-the-middle attack and its application to the camellia block cipher (extended abstract)[C]. 见:13th International Conference on Cryptology in India, INDOCRYPT 2012. Kolkata, India. December 9, 2012 - December 12, 2012.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Lu Jiqiang]'s Articles
[Wei Yongzhuang]'s Articles
[Kim Jongsung]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Lu Jiqiang]‘s Articles
[Wei Yongzhuang]‘s Articles
[Kim Jongsung]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace