DocumentCode :
3025410
Title :
Implementation of arithmetic operation of finite field GF(2n)
Author :
Pu Baoxing ; Chen Jiye
Author_Institution :
Dept. of Inf. Eng., Shaoyang Univ., Shaoyang, China
fYear :
2013
fDate :
20-22 Dec. 2013
Firstpage :
1710
Lastpage :
1714
Abstract :
Finite field GF(2n) is an indispensable mathematical tool for some research fields such as information coding, cryptology and theory and application of network coding. Its arithmetic operation is the foundation of encoding information. Based on its formation, this paper discusses the principle and method of arithmetic operation of finite field GF(2n), and focuses on the inverse operation and division operation, then presents the concrete realization algorithm of arithmetic operation. This paper also analyzes the mechanism of implementing inverse operation with extended Euclidean algorithm. Based on Gauss elimination, an algorithm to implement division operation is proposed, the implementing process of arithmetic operation and the results of simulation calculations are provided.
Keywords :
arithmetic; inverse problems; mathematics computing; polynomials; Gauss elimination; arithmetic operation; division operation; extended Euclidean algorithm; finite field GF(2n); inverse operation; irreducible polynomial; realization algorithm; Educational institutions; Electronic mail; Encoding; Finite element analysis; Galois fields; Polynomials; extended Euclidean algorithm; finite fields GF(2n); inverse operation; irreducible polynomial;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Mechatronic Sciences, Electric Engineering and Computer (MEC), Proceedings 2013 International Conference on
Conference_Location :
Shengyang
Print_ISBN :
978-1-4799-2564-3
Type :
conf
DOI :
10.1109/MEC.2013.6885331
Filename :
6885331
Link To Document :
بازگشت