Understanding Cryptography by Christof Paar and Jan Pelzl - Chapter 4 Solutions - Ex4.8

- 1 min

Exercise 4.8

Find all irreducible polynomials

  1. of degree 3 over ,
  2. of degree 4 over .

The best approach for doing this is to consider all polynomials of lower degree and check whether they are factors. Please note that we only consider monic irreducible polynomials, i.e., polynomials with the highest coefficient equal to one.

Solution

I haven’t yet verified this solution independently. If you spot any mistakes, please leave a comment in the Disqus box at the bottom of the page.

  1. There are two irreducible polynomials in of degree 3:

    •  

    •  

  2. There are three irreducible polynomials in of degree 4:

    •  

    •  

    •  


Thomas Busby

Thomas Busby

I write about computing stuff

comments powered by Disqus
rss facebook twitter github youtube mail spotify instagram linkedin google google-plus pinterest medium vimeo stackoverflow reddit quora