{"title":"Rijndael算法与reed-solonmon算法在伽罗瓦域的运算一致性研究(28)","authors":"Yanguo Zhang, Xiao-Jun Lu","doi":"10.1109/ICACIA.2009.5361164","DOIUrl":null,"url":null,"abstract":"The consistent proof of operation in finite field is presented by studying mathematical operations in Galois Field(28) and comparing Rijndael algorithm with Reed-Solomon algorithm in this paper. The explanation for various operations is given from the perspective of polynomial multiply, especially paying more attention to multiplication operation. Through analysis of mathematical operations, author proves that the basic operations for different implementation approaches in Galois Field(28) are consistent essentially.","PeriodicalId":423210,"journal":{"name":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","volume":"212 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The operation consistency study for Rijndael algorithm and reed-solonmon algorithm in Galois Field(28)\",\"authors\":\"Yanguo Zhang, Xiao-Jun Lu\",\"doi\":\"10.1109/ICACIA.2009.5361164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The consistent proof of operation in finite field is presented by studying mathematical operations in Galois Field(28) and comparing Rijndael algorithm with Reed-Solomon algorithm in this paper. The explanation for various operations is given from the perspective of polynomial multiply, especially paying more attention to multiplication operation. Through analysis of mathematical operations, author proves that the basic operations for different implementation approaches in Galois Field(28) are consistent essentially.\",\"PeriodicalId\":423210,\"journal\":{\"name\":\"2009 International Conference on Apperceiving Computing and Intelligence Analysis\",\"volume\":\"212 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Apperceiving Computing and Intelligence Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICACIA.2009.5361164\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Apperceiving Computing and Intelligence Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICACIA.2009.5361164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The operation consistency study for Rijndael algorithm and reed-solonmon algorithm in Galois Field(28)
The consistent proof of operation in finite field is presented by studying mathematical operations in Galois Field(28) and comparing Rijndael algorithm with Reed-Solomon algorithm in this paper. The explanation for various operations is given from the perspective of polynomial multiply, especially paying more attention to multiplication operation. Through analysis of mathematical operations, author proves that the basic operations for different implementation approaches in Galois Field(28) are consistent essentially.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
