Keywords:-
Article Content:-
Abstract
Finite fields is considered to be the most widely used algebraic structures today due to its applications in cryptography, coding theory, error correcting codes among others. This paper reports the use of extended Euclidean algorithm in computing the greatest common divisor (gcd) of Aunu binary polynomials of cardinality seven. Each class of the polynomial is permuted into pairs until all the succeeding classes are exhausted. The findings of this research reveals that the gcd of most of the pairs of the permuted classes are relatively prime. This results can be used further in constructing some cryptographic architectures that could be used in design of strong encryption schemes
References:-
References
Daniel Panario (2006). A Minicourse in Finite Fields and Applications, School of Mathematics and Statistics, Carleton University.
Dawood Shah and Tariq Shah (2021). Binary Galois field extension dependents multimedia data security scheme. Micropocessors and Microsystems, 77, 103181.
A.A Ibrahim (2007). An Enumeration Scheme and Algebraic properties of a Special (132)-avoiding Class of permutation Pattern. Trends in Applied sciences Research Academic Journals Inc. USA. 2(4) 334-340.
Abubakar S.I, Shehu S., Ibrahim Z. Ibrahim A.A (2014). Some polynomials representation using the 123-avoiding class of the Aunu permutation patterns of cardinality five using binary codes. International Journal of Scientific and Engineering Research 5(8), 1-4.
Saidu Isah Abubakar , Aminu Alhaji Ibrahim (2014). Polynomial Representation of Aunu Permutation Patterns (123-Avoiding), published by Lambert Publishing Company ISBN 978-3-659-63532-8.
Qiang Zhou, T. Chenliang, Z. Hanlin, J. Yu, Fengjun Li (2020). How to securely outsource the extended Euclidean algorithm for large scale polynomials over finite fields. Information Sciences, 641-660.
Cenk, M., Hassan, M.A. (2014). Some new results on binary polynomial multiplication. Journal of Cryptographic Engineering, 5(4), 289-303.
D’angella, D., Schiavo, C.V., Visconti, A (2013). Tight upper bounds for polynomial multiplication. In: Applied Computing Conference 2013. Acc’13. WEAS. 31-37.
McEliece, R.J. (1987). Finite fields for computer scientists and engineers, vol.23. Kluwer Academic Publishers Boston (1987).
Homma, N., Saito, K., Aoki, T. (2014). Toward formal design of practical cryptographic hardware based on Galois field arithmetic. IEEE Transactions on Computers, 63(10), 2604-2613.
Benvenuto, C. J. (2012). Galois field in cryptography. University of Washington, 1(1), 1-11.
Savas, E., & Koç, Ç. K. (2010). Finite field arithmetic for cryptography. IEEE Circuits and Systems Magazine, 10(2), 40-56.
Guajardo, J., Güneysu, T., Kumar, S. S., Paar, C., & Pelzl, J. (2006). Efficient hardware implementation of finite fields with applications to cryptography. Acta Applicandae Mathematica, 93(1-3), 75-118.
Wolf, C., & Preneel, B. (2004). Asymmetric Cryptography: Hidden Field Equations. IACR Cryptology ePrint Archive, 2004, 72.
Shparlinski, I. (2013). Finite Fields: Theory and Computation: The meeting point of number theory, computer science, coding theory and cryptography Vol. 477. Springer Science & Business Media.