Results 1 to 10 of about 94,460 (146)
Normal bases and irreducible polynomials
Let $\mathbb{F}_q$ denote the finite field of $q$ elements and $\mathbb{F}_{q^n}$ the degree $n$ extension of $\mathbb{F}_q$. A normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F} _q$ is a basis of the form $\{\alpha,\alpha^q,\dots,\alpha^{q^{n-1 ...
Cao, Wei, Han, Shanmeng, Huang, Hua
core +2 more sources
Irreducible decomposition of polynomial ideals
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FORTUNA, ELISABETTA +2 more
exaly +5 more sources
The H-polynomial of an irreducible representation
Associated with the finite-dimensional rational representation \(\rho\colon G\to\text{End}(V)\) of a simple algebraic group \(G\) over an algebraically closed field \(K\) there is the monoid \(M_\rho:=\overline{K^*\rho(G)}\subseteq\text{End}(V)\) and projective \(G\times G\)-embedding \(\mathbb P_\rho=[M_\rho\setminus\{0\}]/K^*\).
exaly +2 more sources
Characterization of irreducible polynomials over a special principal ideal ring [PDF]
A commutative ring $R$ with unity is called a special principal ideal ring (SPIR) if it is a non integral principal ideal ring containing only one nonzero prime ideal, its length $e$ is the index of nilpotency of its maximal ideal. In this paper, we show
Brahim Boudine
doaj +1 more source
Hamming distance from irreducible polynomials over $\mathbb {F}_2$ [PDF]
We study the Hamming distance from polynomials to classes of polynomials that share certain properties of irreducible polynomials. The results give insight into whether or not irreducible polynomials can be effectively modeled by these more general ...
Gilbert Lee +2 more
doaj +1 more source
Irreducibility of Random Polynomials [PDF]
14 pages, 9 ...
Christian Borst +5 more
openaire +2 more sources
Necessary and sufficient conditions for the existence of invariant algebraic curves
We present a set of conditions enabling a polynomial system of ordinary differential equations in the plane to have invariant algebraic curves. These conditions are necessary and sufficient. Our main tools include factorizations over the field of Puiseux
Maria Demina
doaj +1 more source
An irreducible polynomial is one of the main components in building an S-box with an algebraic technique approach. The selection of the precise irreducible polynomial will determine the quality of the S-box produced. One method for determining good S-box
Alamsyah Alamsyah
doaj +1 more source
High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA
In the Quantum Key Distribution (QKD) network, authentication protocols play a critical role in safeguarding data interactions among users. To keep pace with the rapid advancement of QKD technology, authentication protocols must be capable of processing ...
Si-Cheng Huang +4 more
doaj +1 more source
A modified Matrices Approach in Advanced Encryption Standard Algorithm [PDF]
The cryptographic algorithms became the main proceeding for protection of very important data from unauthorized access. There are several cryptographic algorithms to ensure the data, but algorithms must be selected according to speed, strength and the ...
Abdul Monem Rahma, Atheer Abbas
doaj +1 more source

