Irreducible Polynomials p 5 degree 4

  • Context: Graduate 
  • Thread starter Thread starter grandnexus
  • Start date Start date
  • Tags Tags
    Degree Polynomials
Click For Summary
SUMMARY

The discussion focuses on constructing a finite field GF(5^4) using irreducible polynomials of degree 4 over the field F_5. The user seeks efficient methods to identify irreducible polynomials modulo 5, as manually testing all polynomials of lower degree is impractical. The conversation highlights the importance of leveraging properties of F_5 to find suitable polynomials that do not factor, suggesting that precomputed lists of irreducible polynomials may not be readily available.

PREREQUISITES
  • Understanding of finite fields, specifically GF(p^n)
  • Knowledge of irreducible polynomials and their significance in field theory
  • Familiarity with polynomial arithmetic in modular systems
  • Basic concepts of field construction and element representation
NEXT STEPS
  • Research methods for finding irreducible polynomials over finite fields
  • Explore existing databases or resources for precomputed irreducible polynomials in GF(p^n)
  • Learn about polynomial factorization techniques in modular arithmetic
  • Study the properties of F_5 and its elements to identify suitable polynomials
USEFUL FOR

This discussion is beneficial for mathematicians, computer scientists, and cryptographers involved in finite field theory, polynomial algebra, and applications in coding theory or cryptography.

grandnexus
Messages
8
Reaction score
0
I am attempting to construct a field containing 625 elements and should be in the form Zn[x] mod f(x).

Factoring 625 leads to 5^4. So I'm guessing my field will be GF(5^4). So in order for me to construct a field with all elements in it, I need f(x) to be some irreducible polynomial mod 5 of degree 4.

How can I go about finding irreducible polynomials? I know I can choose all the polynomials below degree 4 with coefficients mod 5 and attempt to find one without factors, but that would take forever. Is there a quick way to do this or a list of precomputed irreducible polynomials given GF(p^n) where p is prime and n is greater than 1??

Thanks.
 
Physics news on Phys.org
I can't imagine anyone's bothered to precompute anything. The solution is to think about F_5, the field with 5 elements, and decide if you know any polynomial that every element of F_5 satisfies.
 

Similar threads

Undergrad How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
  • · Replies 48 ·
2
Replies
48
Views
6K
Undergrad Looking for a creative or quick method for finding roots in GF(p^n)
  • · Replies 3 ·
Replies
3
Views
2K
Undergrad Irreducible polynomials and prime elements
  • · Replies 5 ·
Replies
5
Views
2K
MHB The polynomial is irreducible over Q(i)
  • · Replies 16 ·
Replies
16
Views
4K
Undergrad Quintic Polynomial Tschirnhaus Transform: Possible complex Bring Radicals
  • · Replies 0 ·
Replies
0
Views
3K
Undergrad Finite fields, irreducible polynomial and minimal polynomial theorem
  • · Replies 6 ·
Replies
6
Views
3K
MHB The irreducible polynomial is not separable
  • · Replies 1 ·
Replies
1
Views
3K
MHB Prove the polynomial f(x)=x^2-q is irreducible in F_p[x]?
  • · Replies 1 ·
Replies
1
Views
2K
Undergrad Localizing single variable quotient polynomial ring at a prime ideal
  • · Replies 6 ·
Replies
6
Views
2K
Undergrad Make a list of all irreducible polynomials of degrees 1 to 5 over F2
  • · Replies 4 ·
Replies
4
Views
4K