A way to compute a greatest common divisor in the Galois field (GF (2^n ))
DOI:
https://doi.org/10.24297/jam.v16i0.8167Keywords:
Greatest common divisor, multiplicative inverse, irreducible polynomial, extended Euclidean algorithm, Bezout identityAbstract
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 ).
Downloads
References
W. Eltayeb Ahmed, Some Techniques to Compute Multiplicative Inverses for Advanced Encryption Standard, Journal of Advances in Mathematics, Vol 16 (2019) ISSN: 2347-1921. https://cirworld.com/index.php/jam
A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC Press, New York, 1997.
John B. Fealenigh , A First Course in Abstract Algebra, 7 th edition, Pearson press , 2002.
Downloads
Published
Issue
Section
License
All articles published in Journal of Advances in Linguistics are licensed under a Creative Commons Attribution 4.0 International License.
