A way to compute a greatest common divisor in the Galois field (GF (2^n ))
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 ).
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.
Copyright (c) 2019 Waleed Eltayeb Ahmed
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors retain the copyright of their manuscripts, and all Open Access articles are distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided that the original work is properly cited.