Open AccessA way to compute a greatest common divisor in the Galois field (GF (2^n ))
Author(s) -
W. Eltayeb Ahmed
Publication year - 2019
Publication title -
journal of advances in mathematics
Language(s) - English
Resource type - Journals
ISSN - 2347-1921
DOI - 10.24297/jam.v16i0.8167
Subject(s) - mathematics , greatest common divisor , multiplicative function , multiplicative inverse , galois theory , divisor (algebraic geometry) , field (mathematics) , finite field , inverse , euclidean geometry , galois module , discrete mathematics , pure mathematics , mathematical analysis , geometry
This paper presents how the steps that used to determine a multiplicative inverse by method based on the Euclidean algorithm, can be used to find a greatest common divisor for polynomials in the Galois field (2^n ).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom