Results 1 to 10 of about 165,308 (288)
Generalized companion matrix for approximate GCD
, 2011 We study a variant of the univariate approximate GCD problem, where the coefficients of one polynomial f(x)are known exactly, whereas the coefficients of the second polynomial g(x)may be perturbed.
Boito, Paola, Ruatta, Olivier
core +2 more sources
Optimized implementation of SMAUG-T on resource-constrained 16-bit MSP430 MCU
ICT ExpressIn 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 +4 more
doaj +1 more source
Faktorisasi Polinomial Aljabar dengan Menggunakan Metode Euclidean dan Faktor Persekutuan Terbesar [PDF]
, 2014 This article discusses a factorization of algebraic polynomial of order n using theEuclidean method and the greatest common factor. The new polynomial is equivalentto the original polynomial.
Gemawati, S. (Sri) +2 more
core
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
On multiple Appell polynomials [PDF]
Proceedings of the American Mathematical Society, 2010 So called Appell polynomials [\textit{P. Appell}, ``Sur une classe de polynômes'', Ann. Sci. Éc. Norm. Supér. (2), 9, 119--144 (1880; JFM 12.0342.02)] have been studied extensively and apart from the defining property: \[ \{P_n(x)\}_0^{\infty}\text{ is a sequence of Appell polynomials }\Leftrightarrow P_n'(x)=nP_{n-1}(x),\;n\geq 1.
openaire +2 more sources
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
Practical fast polynomial multiplication [PDF]
Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976 The “fast” polynomial multiplication algorithms for dense univariate polynomials are those which are asymptotically faster than the classical O(N2) method. These “fast” algorithms suffer from a common defect that the size of the problem at which they start to be better than the classical method is quite large; so large, in fact that it is impractical ...
openaire +1 more source
Almost Split Morphisms, Preprojective Algebras and Multiplication Maps of Maximal Rank [PDF]
, 2005 With a grading previously introduced by the second-named author, the multiplication maps in the preprojective algebra satisfy a maximal rank property that is similar to the maximal rank property proven by Hochster and Laksov for the multiplication maps ...
Diaz, Steven P., Kleiner, Mark
core +3 more sources
Efficient and Low-Cost Modular Polynomial Multiplier for WSN Security
Journal of Sensor and Actuator NetworksWireless Sensor Network (WSN) technology has constrained computing resources that require efficient and low-cost cryptographic hardware to provide security services, particularly when dealing with large modular polynomial multiplication in cryptography ...
Fariha Haroon, Hua Li
doaj +1 more source
Algorithms and Data Structures for Sparse Polynomial Arithmetic
Mathematics, 2019 We provide a comprehensive presentation of algorithms, data structures, and implementation techniques for high-performance sparse multivariate polynomial arithmetic over the integers and rational numbers as implemented in the freely available Basic ...
Mohammadali Asadi +3 more
doaj +1 more source