Hao Guo, Zhiyu Zhang, Qianqian Yang, Lei Hu, Yiyuan Luo
{"title":"一种寻找所有高概率面向词的截断微分的新方法:在Midori、SKINNY和CRAFT中的应用","authors":"Hao Guo, Zhiyu Zhang, Qianqian Yang, Lei Hu, Yiyuan Luo","doi":"10.1093/comjnl/bxab213","DOIUrl":null,"url":null,"abstract":"This paper proposes a new method to find high-probability truncated differentials using matrix muliplication. For Markov cipher with similar round function, suppose that the transition probability matrix of round function is D , then D r contains all the differential probabilities of an r -round block cipher. To reduce the matrix dimension, we consider the word-oriented truncated differential and the truncated transition probability matrix T . Regardless of the effect of the S -box, we focus on whether there is a non-zero difference on one cell instead of the value of the difference. In this case, the matrix dimension reduces significantly and we can calculate T r using a workstation. Then all the r -round truncated differential probabilities can be found from T r . And the probability in T r is the probability of the whole truncated differential hull but not a single or several truncated differential characteristics. Besides, we make a more accurate probability estimation of the truncated differential of lightweight block cipher. Combined with the truncated differential hull, we found some longer truncated differential distinguishers. And as T r stores all the truncated differential probabilities, we can also find all the impossible truncated differentials","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"279 1","pages":"1069-1082"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A New Method To Find All The High-Probability Word-Oriented Truncated Differentials: Application To Midori, SKINNY And CRAFT\",\"authors\":\"Hao Guo, Zhiyu Zhang, Qianqian Yang, Lei Hu, Yiyuan Luo\",\"doi\":\"10.1093/comjnl/bxab213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new method to find high-probability truncated differentials using matrix muliplication. For Markov cipher with similar round function, suppose that the transition probability matrix of round function is D , then D r contains all the differential probabilities of an r -round block cipher. To reduce the matrix dimension, we consider the word-oriented truncated differential and the truncated transition probability matrix T . Regardless of the effect of the S -box, we focus on whether there is a non-zero difference on one cell instead of the value of the difference. In this case, the matrix dimension reduces significantly and we can calculate T r using a workstation. Then all the r -round truncated differential probabilities can be found from T r . And the probability in T r is the probability of the whole truncated differential hull but not a single or several truncated differential characteristics. Besides, we make a more accurate probability estimation of the truncated differential of lightweight block cipher. Combined with the truncated differential hull, we found some longer truncated differential distinguishers. And as T r stores all the truncated differential probabilities, we can also find all the impossible truncated differentials\",\"PeriodicalId\":21872,\"journal\":{\"name\":\"South Afr. Comput. J.\",\"volume\":\"279 1\",\"pages\":\"1069-1082\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"South Afr. Comput. J.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1093/comjnl/bxab213\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"South Afr. Comput. J.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/comjnl/bxab213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Method To Find All The High-Probability Word-Oriented Truncated Differentials: Application To Midori, SKINNY And CRAFT
This paper proposes a new method to find high-probability truncated differentials using matrix muliplication. For Markov cipher with similar round function, suppose that the transition probability matrix of round function is D , then D r contains all the differential probabilities of an r -round block cipher. To reduce the matrix dimension, we consider the word-oriented truncated differential and the truncated transition probability matrix T . Regardless of the effect of the S -box, we focus on whether there is a non-zero difference on one cell instead of the value of the difference. In this case, the matrix dimension reduces significantly and we can calculate T r using a workstation. Then all the r -round truncated differential probabilities can be found from T r . And the probability in T r is the probability of the whole truncated differential hull but not a single or several truncated differential characteristics. Besides, we make a more accurate probability estimation of the truncated differential of lightweight block cipher. Combined with the truncated differential hull, we found some longer truncated differential distinguishers. And as T r stores all the truncated differential probabilities, we can also find all the impossible truncated differentials