Analysis And Research On Related Keys Of Lightweight Block Ciphers

With the rapid development of information era,information security plays an more and more important role in all aspects of social life,and cryptography is the core technology in the field of information security.Block cipher algorithms show great advantages in terms of encryption speed,design standards,large amounts of encrypted data,and hardware and software implementation.However,the traditional block ciphers are not very suitable for resource-constrained environments.As a result,cryptographic designers proposed a lightweight block cipher with high encryption efficiency and high algorithm security.The Khudra algorithm proposed by Souvik Kolay and Debdeep MukhopadhyayDept in SPACE 2014 is an encryption algorithm of Feistel structure.The Midori algorithm proposed by Banik et al.at AISACRYPT2015 is a SPN structure encryption algorithm.This article mainly works in the Khudra algorithm and the Midori algorithm,as follows:?1?According to the weakness of Khudra key schedule algorithm,the author introduced the difference between two keys proposed by Yibin Dai and Shaozhen Chen,and used the key differential analysis to attack Khudra algorithm.This paper introduces differences on a subkey,constructs10 rounds of correlation key difference distinguisher of Khudra algorithm and attacks 16 rounds of Khudra algorithm,the probability of constructing the distinguisher was 2^-28.425.64 bits key was guessed,and the remaining 16 bits used exhaustive search.?2?According to the features of Midori algorithm key schedule algorithm,matrix multiplication and S box,we constructed a 9-round correlation key impossible distinguisher of Midori64 algorithm,We analysed 14 rounds of related key impossible differential of Midori64 algorithm and guessed the 104bit key.