You're free to choose anything you want as long as it can't be factored, meaning it has no roots in your field (mod p). So when working in GF(2^n), you can pick any polynomial of degree n for which neither 0 and 1 are roots.
A polynomial that cannot be factored. A "prime" polynomial, if you will. When you're working in GF(2^n), since everything is mod 2, you need a degree-n polynomial (so it must start with x^n) that ends in +1 (otherwise you could factor an x) and it must have an odd number of terms (to prevent 1 from being a root, mod 2). Anything will work as long as it follows those rules. An example is AES's polynomial, x^8 + x^4 + x^3 + x + 1.
![YoungBoy Never Broke Again - Sneaking [Official Video]](http://i.ytimg.com/vi/1ILUps2zDFU/mqdefault.jpg)
How did you consider p(x) sir? (In 13:10 of video)
Crystal Clear Explanation !!
Very good explanation 👍
Wat r d rules to get IR polynomial
GF(256) 2nd element should be 0000001 but you said 00000010 .... I think this is 3rd element.... What do u say?
really its so informative video 😊💚
How can we choose the irreducible polynomial sir?
same question
You're free to choose anything you want as long as it can't be factored, meaning it has no roots in your field (mod p). So when working in GF(2^n), you can pick any polynomial of degree n for which neither 0 and 1 are roots.
Thanks sir..it was clear explanation
Explain irreducible polynomial
A polynomial that cannot be factored. A "prime" polynomial, if you will. When you're working in GF(2^n), since everything is mod 2, you need a degree-n polynomial (so it must start with x^n) that ends in +1 (otherwise you could factor an x) and it must have an odd number of terms (to prevent 1 from being a root, mod 2). Anything will work as long as it follows those rules. An example is AES's polynomial, x^8 + x^4 + x^3 + x + 1.
thank you
How did you consider p(x) sir? (In 13:10 of video)
Thank you
How can we choose the irreducible polynomial sir?
How can we choose the irreducible polynomial sir?