Security Analysis Of Block Ciphers QARMA And SKINNY

Nowadays,along with the rapidly development of big data,the security of information is receiving more and more attention.As an important cornerstone,block cipher play an irreplaceable role for protecting information security.The most basic and effective analysis methods of block ciphers are differential analysis,linear analysis,impossible differential analysis,and related-key analysis.They are important criterias for confirming the security of cryptographic algorithms.This paper utilizes the related-key impossible differential analysis to attack the QARMA-64 algorithm.Then MILP method is applied to find the minimum number of active S-boxes of differential analysis automatically.Finally,a security threshold is implemented for the non-linear component S-box of the block cipher.The main results are as follows:(1)By the key-schedule properties of QARMA-64,the paper studies the QARMA algorithm's ability to resist related-key impossible differential attack.Then it proposes a 13-round related-key impossible differential attack,and guesses 52 bits key.This paper uses the related-key impossible differential to attack QARMA-64.The method of analysis has the merits of more rounds of attack and lower complexity.(2)Mixed integer linear programming(MILP)comes from linear programming optimization,aimed to achieve some minimum or maximum bound of the objective function.In block cipher,the MILP method can characterize the round function which includes linear operations and non-linear operations accurately.This paper utilizes the MILP method into SKINNY-64/192 algorithm to obtain an 11-round differential path with the minimum number of active S-boxes of 54.In addition,compared with the method proposed by Sun et al.,the paper has a great improvement that no new variables are added in ShiftRows operation,and the total number of variables is relatively reduced,which shorten time to search for the minimum number of active S-boxes.(3)In block cipher,the gliches in the calculation process of the non-linear component S-box lead to the leakage of information by many masking technologies.In this context,the research team of Nikova and Rijmen at the university of Leuven in Belgium,proposed a threshold scheme based on key sharing.The application of the threshold implementations in the nonlinear part of the cryptographic algorithm can reduce the number of hardware implementations required on the gate circuit,and it is more suitable for the encryption algorithm embedded in the RFID tag with low cost requirements.