Cryptanalysis Of Round-reduced AES And Round-reduced PRINCE

Cryptography is the core technology to ensure the cyberspace security,which not only plays an important role in the fields of military,diplomacy and business,but also in our daily life.The Advanced Encryption Standard?AES?is the most widely used data encryption algorithm currently.AES is designed with the SPN structure and based on the wide trail strategy.Although its structure is very simple,it has not been found any security vulnerability since putting forward for more than 20 years.Many cryptography algorithms are designed referring to the AES structure.PRINCE is one of lightweight block cipher with AES-like structure among them.In this paper we do some cryptanalysis on round-reduced AES and PRINCE.The main results are as follows:?1?The relationship between mixture differential distinguisher and yoyo distinguisher on AES is studied.We prove that yoyo distinguisher on 4-round AES is equivalent to the generalized mixture differential distinguisher in the adaptively chosen plaintext and ciphertext setting.Using the relationship between mixture and yoyo,we improve the yoyo cryptanalysis on 6-round AES given in ASIACRYPT 2017,reducing the data complexity from 2122.83 adaptively chosen plaintext and ciphertext pairs to 2120·39.?2?Applying the mixture differential technology of AES to PRINCE,a distinguisher on 4-round PRINCE is given.This distinguisher needs only one pair of plaintexts and ciphertexts in the adaptively chosen plaintext and ciphertext setting,and needs 29 plaintexts in the chosen plaintext setting.Using the 4-round mixture differential distinguisher,a key recovery attack on 5-round PRINCEcore is given with data complexity 214,time complexity 223.68 andmemory complexity 28.?3?The multiple differential cryptanalysis on PRINCE is studied,under the assumption of differential characteristic satisfying Markov chain,a 7-round distinguisher with the longest rounds of PRINCE currently is given.Then we give the key recovery attack on 8-round PRINCE with data complexity 2^61.89,time complexity 219.68)and memory complexity 215.21.Compared with the known results of key recovery attack on 8-round PRINCE,the time complexity and the product of data complexity and time complexity in this paper are both the lowest.