Results 1 to 10 of about 68,753 (202)
High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA [PDF]
Entropy, 2023 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 +2 more sources
Symmetry algebra for the generic superintegrable system on the sphere
Journal of High Energy Physics, 2018 The goal of the present paper is to provide a detailed study of irreducible representations of the algebra generated by the symmetries of the generic quantum superintegrable system on the d-sphere.
Plamen Iliev
doaj +3 more sources
Normal bases and irreducible polynomials
Finite Fields and Their Applications, 2018 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
Sequences of binary irreducible polynomials
Discrete Mathematics, 2013 7 pages, minor ...
Simone Ugolini
exaly +5 more sources
Characterization of irreducible polynomials over a special principal ideal ring [PDF]
Mathematica Bohemica, 2023 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]
Discrete Mathematics & Theoretical Computer Science, 2007 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]
Experimental Mathematics, 2017 14 pages, 9 ...
Christian Borst +5 more
openaire +2 more sources
Modified Cyclotomic Polynomial and Its Irreducibility
Mathematics, 2020 Finding irreducible polynomials over Q (or over Z ) is not always easy. However, it is well-known that the mth cyclotomic polynomials are irreducible over Q .
Ki-Suk Lee, Sung-Mo Yang, Soon-Mo Jung
doaj +1 more source
Scientific Journal of Informatics, 2020 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
Irreducible skew polynomials over domains
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 Let S be a domain and R = S[t; σ, δ] a skew polynomial ring, where σ is an injective endomorphism of S and δ a left σ -derivation. We give criteria for skew polynomials f ∈ R of degree less or equal to four to be irreducible.
Brown C., Pumplün S.
doaj +1 more source