title: How to find irreduciable polynomial for any given digree for multiplying two polynomials?
body: <p>I am working on implementing Galios Field Multiplier on FPGA. I want to implement the multiplier which can multiply for degree 163, 253, 288, 409 and 571. I have found an algorithm to implement multiplier but for testing, I need irreducible polynomial for the given degree.</p>
  
  <p>The question is how to find the irreducible polynomial of the given degree. Also is there any way I can generate expected results to check if the implemented logic is correct. Like any online galios field calculator available.</p>
  
  <p>I tried to search on the internet for a calculator but they are based on predefined irreducible polynomial.</p>