By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yang-Qing Zhang ; Sch. of Comput. Sci. Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu, China ; Xiao-Jun Lu

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.

Published in:

Apperceiving Computing and Intelligence Analysis, 2009. ICACIA 2009. International Conference on

Date of Conference:

23-25 Oct. 2009