中文摘要：

KTANTAN 加密算法是在2009年 CHES 会议上提出的一种轻量级分组密码，KTANTAN 是一族加密算法，包括三种版本 KTANTAN32、KTANTAN48和 KTANTAN64.本文主要对其中的 KTANTAN32加密算法进行分析. KTANTAN32加密算法的轮函数具有较低的差分扩散性，该算法采用线性密钥编排，这使得某些位密钥在后期的加密中才初次被使用，鉴于以上特性，中间相遇攻击方法适用于攻击 KTANTAN32算法.本文在254轮中间相遇攻击的基础上，使用代数方法对单密钥的算法进行中间匹配分析.中间相遇攻击的复杂度为275，在中间匹配阶段，本文使用代数分析不增加攻击复杂度，而且使用的是单密钥方法，不需要进行相关密钥分析，经过计算在中间匹配阶段共有11比特的状态进行匹配，即由向后加密和向前解密得到的两个第127轮的32比特状态值中有11比特是相等的.

英文摘要：

KTANTAN is a family of lightweight block cipher proposed at CHES’09,all three versions consist of KTANTAN32,KTANTAN48 and KTANTAN64. In this paper,we mainly analyze on KTANTAN32. Because of the low difference - diffusion of the round function and the linear key schedule in which some key bits are firstly used in the back rounds used in KTANTAN32,the meet - in - the - middle attack can be easily applied to KTANTAN32. In this paper,the MITM attack is applied for all 254 rounds of KTANTAN32,and single - key analysis and algebraic analytical method are used in intermediate check phase. The complexity of the MITM attack is 275 ,as the methods of single - key analysis and algebraic analysis are made offline,so all of which will not increase the whole complexity. In addition,the related - key analysis is not necessary here. As a result,we find there are 11 internal state bits matching in intermediate check phase,which means 11bits of 32 bits obtained by two directions are equaled in two states of the 127th round.