I'm looking for some applications of criteria of irreducibility of integer polynomials inside and outside mathematics.

I was reading the of CV 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.

Thanks in advance


closed as off-topic by FrankW, Luke Mathieson, Juho, Louis, D.W. May 14 '14 at 10:49

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "This question does not appear to be about computer science, within the scope defined in the help center." – FrankW, Luke Mathieson, Juho, Louis, D.W.
If this question can be reworded to fit the rules in the help center, please edit the question.

  • 2
    $\begingroup$ This is perhaps more appropriate in math.se. $\endgroup$ – Yuval Filmus May 14 '14 at 2:44
  • $\begingroup$ @YuvalFilmus they send me here :) $\endgroup$ – user17640 May 14 '14 at 6:54
  • 1
    $\begingroup$ This question is too broad for any Stack Exchange site. The fact that someone got a grant from NSA doesn't mean much: US agencies give a lot of grants in theoretical topics that don't necessarily have any known industrial applications. (Though in the case of irreducibility of integer polynomials, cryptographic applications are plausible.) $\endgroup$ – Gilles May 14 '14 at 14:03

Browse other questions tagged or ask your own question.