首页> 外文会议>International Conference on Apperceiving Computing and Intelligence Analysis (ICACIA 2009) >The operation consistency study for Rijndael algorithm and reed-solonmon algorithm in Galois Field(28)
【24h】

The operation consistency study for Rijndael algorithm and reed-solonmon algorithm in Galois Field(28)

机译:Galois场中Rijndael算法和reed-solonmon算法的操作一致性研究(2 8

获取原文

摘要

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.
机译:通过研究Galois Field(2 8 )中的数学运算并将Rijndael算法与Reed-Solomon算法进行比较,给出了有限域运算的一致证明。从多项式乘法的角度给出了各种运算的解释,尤其是对乘法运算的关注。通过对数学运算的分析,作者证明了Galois Field(2 8 )中不同实现方法的基本运算本质上是一致的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号