{"title":"Mini-AES CBC-MAC的区分攻击与二次预像攻击","authors":"Cahyo Ramdhani Wulamarisman, Susila Windarta","doi":"10.1109/ICAICTA.2014.7005963","DOIUrl":null,"url":null,"abstract":"In this paper, we present a distinguishing attack and second pre-image attack on specific MAC algorithm based on block cipher, Mini-AES CBC-MAC. Conceptually we use Jia et al. methods, but we perform the attacks with smaller input modification. Using smaller input modification, the results are relatively same. For distinguishing attack, there is no collision in the structure. So, it is Mini-AES CBC-MAC. For second preimage attack, there are collisions in the structure, it means that the structure not fulfill second pre-image resistance. And by birthday paradox the success probability of these attack is given and it is shown that these attack more efficient than exhaustive search.","PeriodicalId":173600,"journal":{"name":"2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Distinguishing attack and second preimage attack on Mini-AES CBC-MAC\",\"authors\":\"Cahyo Ramdhani Wulamarisman, Susila Windarta\",\"doi\":\"10.1109/ICAICTA.2014.7005963\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a distinguishing attack and second pre-image attack on specific MAC algorithm based on block cipher, Mini-AES CBC-MAC. Conceptually we use Jia et al. methods, but we perform the attacks with smaller input modification. Using smaller input modification, the results are relatively same. For distinguishing attack, there is no collision in the structure. So, it is Mini-AES CBC-MAC. For second preimage attack, there are collisions in the structure, it means that the structure not fulfill second pre-image resistance. And by birthday paradox the success probability of these attack is given and it is shown that these attack more efficient than exhaustive search.\",\"PeriodicalId\":173600,\"journal\":{\"name\":\"2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAICTA.2014.7005963\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference of Advanced Informatics: Concept, Theory and Application (ICAICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICTA.2014.7005963","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Distinguishing attack and second preimage attack on Mini-AES CBC-MAC
In this paper, we present a distinguishing attack and second pre-image attack on specific MAC algorithm based on block cipher, Mini-AES CBC-MAC. Conceptually we use Jia et al. methods, but we perform the attacks with smaller input modification. Using smaller input modification, the results are relatively same. For distinguishing attack, there is no collision in the structure. So, it is Mini-AES CBC-MAC. For second preimage attack, there are collisions in the structure, it means that the structure not fulfill second pre-image resistance. And by birthday paradox the success probability of these attack is given and it is shown that these attack more efficient than exhaustive search.