Factorization of polynomials over finite fields information
In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This decomposition is theoretically possible and is unique for polynomials with coefficients in any field, but rather strong restrictions on the field of the coefficients are needed to allow the computation of the factorization by means of an algorithm. In practice, algorithms have been designed only for polynomials with coefficients in a finite field, in the field of rationals or in a finitely generated field extension of one of them.
All factorization algorithms, including the case of multivariate polynomials over the rational numbers, reduce the problem to this case; see polynomial factorization. It is also used for various applications of finite fields, such as coding theory (cyclic redundancy codes and BCH codes), cryptography (public key cryptography by the means of elliptic curves), and computational number theory.
As the reduction of the factorization of multivariate polynomials to that of univariate polynomials does not have any specificity in the case of coefficients in a finite field, only polynomials with one variable are considered in this article.
and 21 Related for: Factorization of polynomials over finite fields information
the factorization by means of an algorithm. In practice, algorithms have been designed only for polynomials with coefficients in a finitefield, in the...
computer algebra, factorizationofpolynomials or polynomialfactorization expresses a polynomial with coefficients in a given field or in the integers...
system has functions for factoring polynomialsoverfinitefields, or, at least, overfinite prime fields. The polynomial X q − X {\displaystyle X^{q}-X}...
integer factorization of 15, and (x – 2)(x + 2) is a polynomialfactorizationof x2 – 4. Factorization is not usually considered meaningful within number...
numbers and overfinitefields, the situation is better than for integer factorization, as there are factorization algorithms that have a polynomial complexity...
univariate polynomialsover a field (there are examples offields for which there does not exist any factorization algorithm for the univariate polynomials). In...
test irreducibility and to compute the factorization into irreducible polynomials (see Factorizationofpolynomials). These algorithms are not practicable...
examples. Every polynomial is associated to a unique monic polynomial. In particular, the unique factorization property ofpolynomials can be stated as:...
curves overfinitefields are notably applied in cryptography and for the factorizationof large integers. These algorithms often make use of the group...
in terms of properties of algebraic objects such as algebraic number fields and their rings of integers, finitefields, and function fields. These properties...
mathematics, the fundamental theorem of arithmetic, also called the unique factorization theorem and prime factorization theorem, states that every integer...
particularly in the fieldof complex analysis, the Hadamard factorization theorem asserts that every entire function with finite order can be represented...
irreducible polynomials or irreducible polynomials times the factor 1 + x, which adds to the code the ability to detect all errors affecting an odd number of bits...
unique factorization is measured by the class number, commonly denoted h, the cardinality of the so-called ideal class group. This group is always finite. The...
contain a splitting field for all the polynomials p over K that are minimal polynomialsover K of elements of K′. Finding roots ofpolynomials has been an important...
algorithm for factorizationofpolynomialsoverfinitefields. The algorithm has a quasi-polynomial complexity under the assumption of generalized Riemann's...
unknown function over the domain. The simple equations that model these finite elements are then assembled into a larger system of equations that models...
have a prime factorization. The result provides a simple framework to understand various canonical form results for square matrices overfields. When a vector...
of the arithmetic of these fields (for prime n) – and more precisely, because of the failure of unique factorization in their rings of integers – that Ernst...
Global Information