Results 61 to 70 of about 6,241 (212)

Polynomials with Odd Orthogonal Multiplicity

Finite Fields and Their Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Nonlinear polynomial systems: multiple roots and their multiplicities [PDF]

Proceedings Shape Modeling Applications, 2004., 2004
We present methods for the computation of roots of univariate and bivariate nonlinear polynomial systems as well as the identification of their multiplicity. We first present an algorithm, called the TDB algorithm, which computes the values and the multiplicities of roots of a univariate polynomial.
Kwang Hee Ko, Takis Sakkalis, Nicholas M. Patrikalakis   +2 more
openaire   +1 more source

Quantum Multiplication of Schur Polynomials

Journal of Algebra, 1999
LaTeX, 20 pages with 11 ...
Bertram, Aaron, Ciocan-Fontanine, Ionuţ, Fulton, William   +2 more
openaire   +3 more sources

Irreducibility and Multiplicative Composition of Polynomials Over Finite Fields [PDF]

, 2023
Leila Benferhat, Omar Kihel, Jesse Larone, Rezki Ould Mohamed   +3 more
openalex   +1 more source

An Efficient Method of Parallel Multiplication on a Single DSP Slice for Embedded FPGAs

IEEE Access, 2019
Field-programmable gate arrays (FPGAs) can efficiently implement custom applications via their embedded digital signal processor (DSP) slices, including binary multipliers.
Zhangqin Huang, Shuo Zhang, Weidong Wang
doaj   +1 more source

On Hyperbolic Polynomials with Multiple Roots [PDF]

Proceedings of the American Mathematical Society, 1969
Let Q(z) Q(z, **, zn) be a polynomial of degree m > 1 in Z(Zl, , * Zn) with complex coefficients. Let P(z) be the principal part, homogeneous of degree m. Q is defined to be hyperbolic with respect to the real vector t-(4, , n) $0, in the sense of Garding [1], if P(t)z0 and if there exists a real number to such that for Re r> to, and all real vectors 7,
openaire   +2 more sources

High- and Half-Degree Quantum Multiplication for Post-Quantum Security Evaluation

IEEE Access
This paper provides a thorough examination of strategies related to the design of the polynomial multiplication approach, which is essential to resolving large number operations, including multiplication in the post-quantum cryptography algorithm.
Rini Wisnu Wardhani, Dedy Septono Catur Putranto, Howon Kim   +2 more
doaj   +1 more source

Optimized implementation of SMAUG-T on resource-constrained 16-bit MSP430 MCU

ICT Express
In this paper, we present an optimized implementation of SMAUG-T, one of Round 2 Key Encapsulation Mechanism algorithms in Korean Post-quantum Cryptography Competition, on a widely used 16-bit MSP430 MCU.
MinGi Kim, DongHyun Shin, WooHyung Ko, YoungBeom Kim, Seog Chung Seo   +4 more
doaj   +1 more source

Efficient Polynomial Multiplication Architecture for ML-KEM PQC Scheme

IEEE Access
The Module Lattice-based Key Encapsulation Mechanism (ML-KEM) has been standardized by the National Institute of Standards and Technology (NIST) to replace the current public-key schemes.
Khalid Javeed, Fadi N. Sibai, Ali El-Moursy   +2 more
doaj   +1 more source

The circulant hash revisited

Journal of Mathematical Cryptology, 2020
At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes
Araujo Filipe, Neves Samuel
doaj   +1 more source