Zero-Correlation Linear Cryptanalysis of Reduced-Round SIMON

In June 2013, the U.S. National Security Agency proposed two families of lightweight block ciphers, called SIMON and SPECK respectively. These ciphers are designed to perform excellently on both hardware and software platforms. In this paper, we mainly present zero-correlation linear cryptanalysis o...

Full description

Saved in:
Bibliographic Details
Published inJournal of computer science and technology Vol. 30; no. 6; pp. 1358 - 1369
Main Author 于晓丽 吴文玲 石振青 张建 张蕾 汪艳凤
Format Journal Article
LanguageEnglish
Published New York Springer US 01.11.2015
Springer Nature B.V
Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences Beijing 100190, China
University of Chinese Academy of Sciences, Beijing 100049, China%Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences Beijing 100190, China
Subjects
Algorithms
Approximation
Artificial Intelligence
Blocking
Computer information security
Computer programs
Computer Science
Correlation
Cryptography
Data Structures and Information Theory
Encryption
Hardware
Information Systems Applications (incl.Internet)
National security
Platforms
Regular Paper
Science
Software
Software Engineering
Theory of Computation
Weight reduction
分组密码
国家安全
恢复阶段
线性密码分析
线性攻击
缩减
软件平台
零相关
linear cryptanalysis
lightweight block cipher
SIMON
zero-correlation
dual property
Online AccessGet full text
ISSN1000-9000
1860-4749
DOI10.1007/s11390-015-1603-5

Cover

More Information
Summary:In June 2013, the U.S. National Security Agency proposed two families of lightweight block ciphers, called SIMON and SPECK respectively. These ciphers are designed to perform excellently on both hardware and software platforms. In this paper, we mainly present zero-correlation linear cryptanalysis on various versions of SIMON. Firstly, by using miss- in-the-middle approach, we construct zero-correlation linear distinguishers of SIMON, and zero-correlation linear attacks are presented based oi1 careful analysis of key recovery phase. Secondly, multidimensional zero-correlation linear attacks are used to reduce the data complexity. Our zero-correlation linear attacks perform better than impossible differential attacks proposed by Abed et al. in ePrint Report 2013/568. Finally, we also use the divide-and-conquer technique to improve the results of linear cryptanalysis proposed by Javad et al. in ePrint Report 2013/663.
Bibliography:Xiao-Li Yu, Wen-Ling Wu, Zhen-Qing Shi, Jian Zhang, Lei Zhang, Yan-Feng Wang（ 1. Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences Beijing 100190, China; 2. University of Chinese Academy of Sciences, Beijing 100049, China）
11-2296/TP
In June 2013, the U.S. National Security Agency proposed two families of lightweight block ciphers, called SIMON and SPECK respectively. These ciphers are designed to perform excellently on both hardware and software platforms. In this paper, we mainly present zero-correlation linear cryptanalysis on various versions of SIMON. Firstly, by using miss- in-the-middle approach, we construct zero-correlation linear distinguishers of SIMON, and zero-correlation linear attacks are presented based oi1 careful analysis of key recovery phase. Secondly, multidimensional zero-correlation linear attacks are used to reduce the data complexity. Our zero-correlation linear attacks perform better than impossible differential attacks proposed by Abed et al. in ePrint Report 2013/568. Finally, we also use the divide-and-conquer technique to improve the results of linear cryptanalysis proposed by Javad et al. in ePrint Report 2013/663.
lightweight block cipher, SIMON, linear cryptanalysis, zero-correlation, dual property
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-015-1603-5