Rijndael s -box结构试验研究

2010 Second International Workshop on Education Technology and Computer Science Pub Date : 2010-03-06 DOI:10.1109/ETCS.2010.227

Zhuo-Hui Xian, S. Sun

{"title":"Rijndael s -box结构试验研究","authors":"Zhuo-Hui Xian, S. Sun","doi":"10.1109/ETCS.2010.227","DOIUrl":null,"url":null,"abstract":"This paper constructs 30 different S-boxes of Rijndael algorithm by MATLAB using 30 irreducible polynomials the maximum power of which is eight in GF(28). Then, through taking four kinds of cryptographic properties tests and fifteen kinds of cryptograph randomness tests on 30 different S-boxes, we find that the S-box which is constructed by No.22 irreducible polynomial is better than the original S-box of Rijndael algorithm.","PeriodicalId":193276,"journal":{"name":"2010 Second International Workshop on Education Technology and Computer Science","volume":"231 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Study on Test for Structure of S-boxes in Rijndael\",\"authors\":\"Zhuo-Hui Xian, S. Sun\",\"doi\":\"10.1109/ETCS.2010.227\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper constructs 30 different S-boxes of Rijndael algorithm by MATLAB using 30 irreducible polynomials the maximum power of which is eight in GF(28). Then, through taking four kinds of cryptographic properties tests and fifteen kinds of cryptograph randomness tests on 30 different S-boxes, we find that the S-box which is constructed by No.22 irreducible polynomial is better than the original S-box of Rijndael algorithm.\",\"PeriodicalId\":193276,\"journal\":{\"name\":\"2010 Second International Workshop on Education Technology and Computer Science\",\"volume\":\"231 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Workshop on Education Technology and Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ETCS.2010.227\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Workshop on Education Technology and Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETCS.2010.227","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

本文利用GF(28)中最大功率为8的30个不可约多项式，通过MATLAB构建了30种不同的Rijndael算法s -box。然后，通过在30种不同的s盒上进行4种密码学性质测试和15种密码学随机性测试，我们发现由No.22不可约多项式构造的s盒优于Rijndael算法的原始s盒。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Study on Test for Structure of S-boxes in Rijndael

This paper constructs 30 different S-boxes of Rijndael algorithm by MATLAB using 30 irreducible polynomials the maximum power of which is eight in GF(28). Then, through taking four kinds of cryptographic properties tests and fifteen kinds of cryptograph randomness tests on 30 different S-boxes, we find that the S-box which is constructed by No.22 irreducible polynomial is better than the original S-box of Rijndael algorithm.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 Second International Workshop on Education Technology and Computer Science

自引率

0.00%

发文量