Khadija Achkoun, Charifa Hanin, Anas Sadak, Fatima Ezzahra Ziani, F. Omary
{"title":"SPF-CA-1.2:基于元胞自动机的分组密码系统的增强版本","authors":"Khadija Achkoun, Charifa Hanin, Anas Sadak, Fatima Ezzahra Ziani, F. Omary","doi":"10.1080/23799927.2021.1942991","DOIUrl":null,"url":null,"abstract":"In this article, an enhanced version of SPF is presented. SPF is a previously developed cellular automata-based block cipher that combines Substitution-Permutation Networks (SPN) with a Feistel scheme using key-dependent S-boxes. SPF system has satisfying cryptographic properties against attacks. However, the rule 30 used in the Feistel round function was subject to an attack by Meier and Staffelbach (MS-attack). In order to avoid this attack, a new construction of SPF, namely SPF-CA 1.2, is proposed using a new ruleset combining linear and non-linear rules. In addition, a robust and fast key scheduling algorithm is employed to improve key efficiency. Moreover, the number of rounds has been reduced while conserving the high confusion and diffusion properties of the previous version. A thorough security analysis reveals the efficiency and robustness of the proposed construction.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2021-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SPF-CA-1.2: an enhanced version of cellular automata-based block cipher system\",\"authors\":\"Khadija Achkoun, Charifa Hanin, Anas Sadak, Fatima Ezzahra Ziani, F. Omary\",\"doi\":\"10.1080/23799927.2021.1942991\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, an enhanced version of SPF is presented. SPF is a previously developed cellular automata-based block cipher that combines Substitution-Permutation Networks (SPN) with a Feistel scheme using key-dependent S-boxes. SPF system has satisfying cryptographic properties against attacks. However, the rule 30 used in the Feistel round function was subject to an attack by Meier and Staffelbach (MS-attack). In order to avoid this attack, a new construction of SPF, namely SPF-CA 1.2, is proposed using a new ruleset combining linear and non-linear rules. In addition, a robust and fast key scheduling algorithm is employed to improve key efficiency. Moreover, the number of rounds has been reduced while conserving the high confusion and diffusion properties of the previous version. A thorough security analysis reveals the efficiency and robustness of the proposed construction.\",\"PeriodicalId\":37216,\"journal\":{\"name\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2021-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Mathematics: Computer Systems Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23799927.2021.1942991\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Mathematics: Computer Systems Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23799927.2021.1942991","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
本文提出了一种增强版本的SPF。SPF是先前开发的基于元胞自动机的分组密码,它将替换置换网络(SPN)与使用依赖密钥的s盒的Feistel方案结合在一起。SPF系统具有良好的抗攻击加密性能。然而,在Feistel回合函数中使用的规则30受到了Meier和Staffelbach的攻击(MS-attack)。为了避免这种攻击,本文提出了一种新的SPF结构SPF- ca 1.2,使用线性和非线性规则相结合的新规则集。此外,采用了鲁棒快速的密钥调度算法来提高密钥效率。此外,减少了弹数,同时保留了前一版本的高混淆和扩散特性。全面的安全性分析揭示了所提出的结构的效率和鲁棒性。
SPF-CA-1.2: an enhanced version of cellular automata-based block cipher system
In this article, an enhanced version of SPF is presented. SPF is a previously developed cellular automata-based block cipher that combines Substitution-Permutation Networks (SPN) with a Feistel scheme using key-dependent S-boxes. SPF system has satisfying cryptographic properties against attacks. However, the rule 30 used in the Feistel round function was subject to an attack by Meier and Staffelbach (MS-attack). In order to avoid this attack, a new construction of SPF, namely SPF-CA 1.2, is proposed using a new ruleset combining linear and non-linear rules. In addition, a robust and fast key scheduling algorithm is employed to improve key efficiency. Moreover, the number of rounds has been reduced while conserving the high confusion and diffusion properties of the previous version. A thorough security analysis reveals the efficiency and robustness of the proposed construction.