Results 11 to 20 of about 9,407 (175)
Numerical semigroups, cyclotomic polynomials, and Bernoulli numbers [PDF]
Moree, P.
core +3 more sources
Single polynomials that correspond to pairs of cyclotomic polynomials with interlacing zeros
McKee James, Smyth Chris
doaj +2 more sources
Revisiting Multivariate Ring Learning with Errors and Its Applications on Lattice-Based Cryptography
The “Multivariate Ring Learning with Errors” problem was presented as a generalization of Ring Learning with Errors (RLWE), introducing efficiency improvements with respect to the RLWE counterpart thanks to its multivariate structure.
Alberto Pedrouzo-Ulloa +4 more
doaj +1 more source
Summary: The \(n\)-th cyclotomic polynomial \({\Phi}_n(x)\) is irreducible over \(\mathbb{Q}\) and has integer coefficients. The degree of \({\Phi}_n(x)\) is \({\varphi}(n)\), where \({\varphi}(n)\) is the Euler Phi-function. In this paper, we define the semi-cyclotomic polynomial \(J_n(x)\).
Lee, Ki-Suk, Lee, Ji-Eun, Kim, Ji-Hye
openaire +2 more sources
Some subgroups of $\mathbb{F}_q^*$ and explicit factors of $x^{2^nd}-1\in\mathbb{F}_q[x]$ [PDF]
Let $\mathcal{S}_q$ denote the group of all square elements in the multiplicative group $\mathbb{F}_q^*$ of a finite field $\mathbb{F}_q$ of odd characteristic containing $q$ elements.
Manjit Singh
doaj +1 more source
Improved Ring LWR-Based Key Encapsulation Mechanism Using Cyclotomic Trinomials
In the field of post-quantum cryptography, lattice-based cryptography has received the most noticeable attention. Most lattice-based cryptographic schemes are constructed based on the polynomial ring Rq = Zq[x]/f (x), using a cyclotomic polynomial f (x).
So Hyun Park +3 more
doaj +1 more source
Kutasov-Seiberg dualities and cyclotomic polynomials
We classify all Kutasov-Seiberg type dualities in large N c SQCD with adjoints of rational R-charges. This is done by equating the superconformal index of the electric and magnetic theories: the obtained equation has a solution each time some product of ...
Borut Bajc
doaj +1 more source
Revisiting the Melvin-Morton-Rozansky expansion, or there and back again
Alexander polynomial arises in the leading term of a semi-classical Melvin-Morton-Rozansky expansion of colored knot polynomials. In this work, following the opposite direction, we propose how to reconstruct colored HOMFLY-PT polynomials ...
Sibasish Banerjee +2 more
doaj +1 more source
A new formula for the coefficients of Gaussian polynomials
We deduce exact integral formulae for the coefficients of Gaussian, multinomial and Catalan polynomials. The method used by the authors in the papers [2, 3, 4] to prove some new results concerning cyclotomic and polygonal polynomials, as well as some of ...
Andrica Dorin, Bagdasar Ovidiu
doaj +1 more source
Mixing Additive and Multiplicative Masking for Probing Secure Polynomial Evaluation Methods
Masking is a sound countermeasure to protect implementations of block- cipher algorithms against Side Channel Analysis (SCA). Currently, the most efficient masking schemes use Lagrange’s Interpolation Theorem in order to represent any S- box by a ...
Axel Mathieu-Mahias, Michaël Quisquater
doaj +1 more source

