Polynomials/ galois field question

In summary, the conversation discusses a section on polynomials and Galois fields, specifically focusing on an irreducible polynomial with roots in GF(2) and a test to prove its irreducibility. The test involves substituting one of the roots into a polynomial and concluding that it must be irreducible. The conversation ends with the realization that the topic should be moved to the algebra forum.
  • #1
JamesGoh
143
0
[SOLVED] polynomials/ galois field question

Im reading through a section that deals with polynomials Galois fields and ran into something that I am not quite understanding.

Say we have an irreducible polynomial, f(x), which has coefficients from GF(2) and roots
[tex]\beta[/tex], [tex]\beta[/tex][tex]^{2}[/tex], [tex]\beta[/tex][tex]^{4}[/tex], [tex]\beta[/tex][tex]^{8}[/tex], ...[tex]\beta[/tex][tex]^{2}[/tex][tex]^{e}[/tex][tex]-1[/tex] where e is the smallest integer such that [tex]\beta[/tex][tex]^{2}[/tex][tex]^{e}[/tex] = [tex]\beta[/tex]

given by

f(x) = [tex]\prod[/tex][tex]^{e-1}_{i=0}[/tex] ( X + [tex]\beta[/tex][tex]^{2^i}[/tex])

Note: Beta term is Beta^(2^i)

In the section I am reading, they do a test to prove f(x) is irreducible. I will state the test below

Say f(x) = a(x).b(x) where a(x) and b(x) are polynomials with coefficients from GF(2)

if we sub one of the roots of f(x) in, say [tex]\beta[/tex], f([tex]\beta[/tex]) = 0 which means that either a([tex]\beta[/tex]) = 0 or b([tex]\beta[/tex]) = 0, hence a(x) = f(x) or b(x) = f(x). This understanding also says that a(x) or b(x) (depending which one had [tex]\beta[/tex] subbed into it) has all the roots of f(x) (A theory in my textbook says that if f([tex]\beta[/tex]) = 0, f([tex]\beta[/tex][tex]^{2^i}[/tex])=0 for any i)

I get how they arrive at their result, however I am still clueless as to how this proves that
f(x) is irreducible.

insight is appreciated

regards
James
 
Last edited:
Physics news on Phys.org
  • #2
Ok I read over the notes again and think I may have the answer

Since f(x) = a(x) or f(x) = b(x) when the root is substituted in, it cannot be divided into a smaller polynomial with a non-zero degree. Therefore f(x) must be irreducible.

Thoughts, comments, insights ??
 
  • #3
I'm confused. You start out by saying that f(x) is irreducible, presumably over GF(2). Then you go on to prove that f(x) is irreducible - this time over what?

Also, why is this in the Set Theory, Logic, Probability, Statistics forum? It really should be in the algebra forum.
 
  • #4
I'm confused. You start out by saying that f(x) is irreducible, presumably over GF(2). Then you go on to prove that f(x) is irreducible - this time over what?

I answered my own question (see f(x)=a(x).b(x) proof), it was just that I didn't read over the notes properly.

Sorry about the confusion

Also, someone pls move this topic to the correct forum. ta
 
Last edited:

FAQ: Polynomials/ galois field question

What are polynomials?

Polynomials are algebraic expressions that consist of variables and coefficients, and are composed of terms that are combined using addition, subtraction, multiplication, and division. They are commonly written in the form of ax^n + bx^(n-1) + ... + cx + d, where a, b, c, and d are constants and n is a non-negative integer.

How do you add and subtract polynomials?

To add or subtract polynomials, you simply combine like terms by adding or subtracting their coefficients. For example, (2x^2 + 3x + 5) + (4x^2 + 2x + 1) = 6x^2 + 5x + 6. If there are no like terms, the polynomial is already in its simplest form and cannot be further simplified.

What is a galois field?

A galois field, also known as a finite field, is a mathematical structure that consists of a finite set of elements and two binary operations: addition and multiplication. It is often represented as GF(p^n), where p is a prime number and n is a positive integer. Galois fields have important applications in coding theory and cryptography.

How do you perform multiplication and division in a galois field?

In a galois field, multiplication and division are performed using specific rules and algorithms. For example, to multiply two elements a and b in a galois field GF(p^n), you first find the product ab in the field, and then use the modulus operation to reduce the result to the range of 0 to p^n-1. Division is done by finding the multiplicative inverse of the divisor, and then multiplying it with the dividend.

What is the significance of galois fields in cryptography?

Galois fields play a crucial role in cryptography as they provide a finite and discrete set of numbers, making it easier to perform complex operations in a secure manner. They are used in various cryptographic algorithms, such as the Advanced Encryption Standard (AES) and the Rivest-Shamir-Adleman (RSA) algorithm.

Similar threads

Replies
1
Views
796
Replies
14
Views
2K
Replies
7
Views
2K
Replies
2
Views
1K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
5
Views
898
Replies
1
Views
1K
Replies
1
Views
876
Back
Top