Linear Cryptanalysis of Reduced-Round PRIDE Block Cipher

YI Wen-tan; TIAN Ya; CHEN Shao-zhen

doi:10.3969/j.issn.0372-2112.2017.02.028

您当前的位置：

首页 >

文章列表页 >

Linear Cryptanalysis of Reduced-Round PRIDE Block Cipher

更新时间：2025-07-16

- Linear Cryptanalysis of Reduced-Round PRIDE Block Cipher
- Acta Electronica Sinica Vol. 45, Issue 2, Pages: 468-476(2017)
- 作者机构：
  
  数学工程与先进计算国家重点实验室,河南,郑州,450001
- 作者简介：
- 基金信息：
  
  Open Fund of Key Laboratory of Information Assurance Technology (No.KJ-13-010)
- DOI：10.3969/j.issn.0372-2112.2017.02.028
  CLC： TP309
- Published Online：25 February 2017，
  
  Published：2017
- 稿件说明：
移动端阅览
YI Wen-tan, TIAN Ya, CHEN Shao-zhen. Linear Cryptanalysis of Reduced-Round PRIDE Block Cipher[J]. Acta Electronica Sinica, 2017, 45(2): 468-476.
DOI：

YI Wen-tan, TIAN Ya, CHEN Shao-zhen. Linear Cryptanalysis of Reduced-Round PRIDE Block Cipher[J]. Acta Electronica Sinica, 2017, 45(2): 468-476. DOI： 10.3969/j.issn.0372-2112.2017.02.028.

摘要

PRIDE是Albrecht等人在2014美密会上提出的轻量级分组密码算法.PRIDE采用典型SPN密码结构，共迭代20轮.其设计主要关注于线性层，兼顾了算法的效率和安全.该文探讨了

盒和线性层矩阵的线性性质，构造了16条优势为2

-5

的2轮线性逼近和8条优势为2

-3

的1轮线性逼近.利用合适的线性逼近，结合密钥扩展算法、

盒的线性性质和部分和技术，我们对18轮和19轮PRIDE算法进行了线性分析.该分析分别需要2

个已知明文，2

74.9

次18轮加密和2

个已知明文，2

74.9

次19轮加密.另外，我们给出了一些关于

盒差分性质和线性性质之间联系的结论，有助于减少攻击过程中的计算量.本文是已知明文攻击.本文是关于PRIDE算法的第一个线性分析.

Abstract

PRIDE is a light weight block cipher designed by Albrecht et al.in CRYPTO 2014

which adopts the classical SPN (Substitution Permutation Network) structure and iterates for 20 rounds.The construction of linear layers is very interesting and performances good both in security and efficiency.This paper investigates the properties of the S-boxes and the linear matrices

and then constructs 16 different 2-round iterative linear approximations with the bis 2

-5

and 8 different 1-round iterative linear approximations with the bis 2

-3

.Base on some suitable approximations

attacks on 18-round and 19-round

PRIDE are presented by means of linear cryptanalysis with the properties of key schedule

the linear characteristics and the partial-sum technique

which need about 2

74.9

encryptions with 2

known plaintexts and 2

74.9

encryptions with 2

known plaintexts

respectively.Furthermore

some interesting links between differential and linear characteristics are shown

which are helpful to reduce the compute complexity.Our analysis is the first linear attack on PRIDE block cipher with known plaintexts.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Research on the Linear Approximation Relationship of Addition Modulo m

Security Evaluation Against Impossible Differential Cryptanalysis and Zero Correlation Linear Cryptanalysis for Two Dynamic Cryptographic Structures

Construction of Fault Injection Attacks Resistant S-Boxes

Reverse-Engineering Secret S-box of Block Ciphers by Persistent Fault

New Integral Attack on Rijndael-256

Related Author

WANG Jian

QI Wen-feng

ZHENG Qun-xiong

SHEN Xuan

LIU Guo-qiang

SUN Bing

HE Jun

CHAI Jin-jin

Related Institution

PLA Information Engineering University State Key Laboratory of Mathematical Engineering and Advanced Computing

College of Information and Communication， National University of Defense Technology

College of Sciences， National University of Defense Technology

State Key Laboratory of Information Security， Institute of Information Engineering， Chinese Academy of Sciences

Hunan Engineering Research Center of Commercial Cryptography Theory and Technology Innovation

⁰