Results 21 to 30 of about 5,753 (265)
Computing Sparse Multiples of Polynomials [PDF]
Algorithmica, 2010 We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t non-zero terms, and if so, to find such an h.
Mark Giesbrecht +2 more
openaire +6 more sources
On multiple q-Laguerre polynomials
Journal of Classical Analysis, 2023 Summary: We study \(q\)-Laguerre multiple orthogonal polynomials. These polynomials are orthogonal with respect to \(q\)-analogues of Laguerre weight functions. We focus our attention on their structural properties. Raising and lowering operators as well as Rodrigues-type formulas are obtained and their explicit representations are given.
Sadjang, P. Njionou +2 more
openaire +2 more sources
FourierPIM: High-throughput in-memory Fast Fourier Transform and polynomial multiplication
Memories - Materials, Devices, Circuits and Systems, 2023 The Discrete Fourier Transform (DFT) is essential for various applications ranging from signal processing to convolution and polynomial multiplication. The groundbreaking Fast Fourier Transform (FFT) algorithm reduces DFT time complexity from the naive O(
Orian Leitersdorf +4 more
doaj +1 more source
Multiplication Rules for Polynomials [PDF]
Proceedings of the American Mathematical Society, 1978 It is proved that the polynomial solutions of the functional equation \[ F ( z )
openaire +2 more sources
Configurable Mixed-Radix Number Theoretic Transform Architecture for Lattice-Based Cryptography
IEEE Access, 2022 Lattice-based cryptography continues to dominate in the second-round finalists of the National Institute of Standards and Technology post-quantum cryptography standardization process. Computational efficiency is primarily considered to evaluate promising
Phap Duong-Ngoc, Hanho Lee
doaj +1 more source
IEEE Access, 2020 In a distributed computing environment, there may exist slow processing workers, which are known as “stragglers”, and they can slow down the whole computing process.
Sangwoo Hong, Heecheol Yang, Jungwoo Lee
doaj +1 more source
Area-Efficient Polynomial Multiplication Hardware Implementation for Lattice-based Cryptography [PDF]
Jisuanji gongchengLattice-based post-quantum cryptography algorithms demonstrate significant potential in public-key cryptography. A key performance bottleneck in hardware implementation is the computational complexity of polynomial multiplication. To address the problems
XIE Jiaxing, PU Jinwei, FANG Weitian, ZHENG Xin, XIONG Xiaoming
doaj +1 more source
Racing BIKE: Improved Polynomial Multiplication and Inversion in Hardware
Transactions on Cryptographic Hardware and Embedded Systems, 2021 BIKE is a Key Encapsulation Mechanism selected as an alternate candidate in NIST’s PQC standardization process, in which performance plays a significant role in the third round.
Jan Richter-Brockmann +3 more
doaj +1 more source
A lower bound for the multiplication of polynomials modulo a polynomial [PDF]
Information Processing Letters, 1992 In 1983 \textit{A. Lempel}, \textit{G. Seroussi} and \textit{S. Winograd} [Theor. Comput. Sci. 22, 285-296 (1983; Zbl 0498.68027)] proved the lower bound \((2+1/(q-1))n-o(n)\) for the multiplicative complexity of the multiplication of two polynomials of degree \(n-1\) modulo an irreducible polynomial \(p\) of degree \(n\) over a finite field \(F\) with
openaire +2 more sources
Parallel Integer Polynomial Multiplication [PDF]
2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2016 We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantages of this new approach.
Changbo Chen +5 more
openaire +4 more sources