The GCD of x^3+ x + 1 and x^2 + x + 1 over GF(2) is
(a) 1
(b) x + 1
(c) x^2
(d) x^2 + 1
I have been asked this question during an online exam.
Query is from Polynomial and Modular Arithmetic- IV topic in chapter Basic Concepts in Number Theory and Finite Fields of Cryptograph & Network Security