I'm looking for some applications of criteria of irreducibility of integer polynomials inside and outside mathematics.
I was reading the CV of Filaseta, a great researcher in this area and he has gained some grants from NSA. Then this makes me think if there are some applications of this matter to computer science.
My question is broader, which are the applications of these criteria of irreducibility such as Eisenstein, Dumas criterion, etc. to the real world or other areas of mathematics?
Thanks in advance