An Related-Key Meet-in-the-Middle Algebraic Attack on the NLFSR Based Block Cipher KTANTAN32

ZHANG Wen-ying; LIU Xiang-zhong

doi:10.3969/j.issn.0372-2112.2012.10.032

您当前的位置：

首页 >

文章列表页 >

An Related-Key Meet-in-the-Middle Algebraic Attack on the NLFSR Based Block Cipher KTANTAN32

更新时间：2025-07-16

- An Related-Key Meet-in-the-Middle Algebraic Attack on the NLFSR Based Block Cipher KTANTAN32
- Acta Electronica Sinica Vol. 40, Issue 10, Pages: 2097-2100(2012)
- 作者机构：
  
  1. 山东师范大学信息科学与工程学院,山东,济南,250014
  2. 山东师范大学第二附属中学,山东,济南,250014
  3. 山东省分布式计算机软件新技术重点实验室,山东,济南,250014
  4. 中国科学院信息工程研究所信息安全国家重点实验室,北京,100093
  5. 山东师范大学信息科学与工程学院,山东,济南,250014
  6. 山东师范大学第二附属中学,山东,济南,250014
  7. 山东省分布式计算机软件新技术重点实验室,山东,济南,250014
  8. 中国科学院信息工程研究所信息安全国家重点实验室,北京,100093
- 作者简介：
- 基金信息：
- DOI：10.3969/j.issn.0372-2112.2012.10.032
  CLC： TN918.1
- Published：2012
- 稿件说明：
移动端阅览
ZHANG Wen-ying, LIU Xiang-zhong. An Related-Key Meet-in-the-Middle Algebraic Attack on the NLFSR Based Block Cipher KTANTAN32[J]. Acta Electronica Sinica, 2012, 40(10): 2097-2100.
DOI：

ZHANG Wen-ying, LIU Xiang-zhong. An Related-Key Meet-in-the-Middle Algebraic Attack on the NLFSR Based Block Cipher KTANTAN32[J]. Acta Electronica Sinica, 2012, 40(10): 2097-2100. DOI： 10.3969/j.issn.0372-2112.2012.10.032.

摘要

本文分析了KTANTAN32的代数学弱点.使用相关密钥中间相遇攻击

用代数推导的方法得到了在240轮之后所使用某些密钥的一元线性方程

解这些方程便可迅速逐比特恢复相应密钥.因只须一对相关密钥和2个明密文

即可恢复部分密钥比特

攻击的时间复杂度和空间复杂度都可以忽略不计.分析表明KTANTAN32是一个很弱的算法.同时也说明使用NLFSR和线性密钥编排是KTANTAN32的致命弱点

为抵抗相关密钥中间相遇攻击

设计者应在密钥编排中加入非线性因素.

Abstract

In this paper

we analyze the algebraic weakness of KTANTAN32.Using related-key and meet-in-the-middle match attack

by algebraic deducing

we get some single-variable linear equations on some key bits and can recover these key bits instantly by solving these algebraic equations one by one.We can recover the key bits with only one pairs of related-keys

2 plaintext/ciphertext pairs.The time complexity and the memory complexity are all negligible.Which indicates that the KTANTAN32 is a very weaker cryptographic system.We conclude that using the NFSR update mode and the linearity of the key schedule together is the fatal weakness of KTANTANs.In order to prevent the cipher from meet in the middle and match attack

it is important to introduce some nonlinearity in the key schedule of this block cipher.

关键词

Keywords

references

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Real-World Attack of 8-Round CLEFIA

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

TANG Xue-hai

SUN Bing

LI Chao

SHEN Xuan

LIU Guo-qiang

SUN Bing

HE Jun

CHAI Jin-jin

Related Institution

Department of Mathematics and System Science,National University of Defense Technology

Hunan Engineering Research Center of Commercial Cryptography Theory and Technology Innovation

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

College of Sciences， National University of Defense Technology

College of Information and Communication， National University of Defense Technology

⁰