Results 71 to 80 of about 6,241 (212)
Multiple Askey–Wilson polynomials and related basic hypergeometric multiple orthogonal polynomials
Transactions of the American Mathematical Society, 2020 We first show how one can obtain Al-Salam--Chihara polynomials, continuous dual $q$-Hahn polynomials, and Askey--Wilson polynomials from the little $q$-Laguerre and the little $q$-Jacobi polynomials by using special transformations. This procedure is then extended to obtain multiple Askey--Wilson, multiple continuous dual $q$-Hahn, and multiple Al ...
Nuwacu, Jean Paul, Van Assche, Walter
openaire +3 more sources
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
Quasi-multiplication and polynomial sequences
Discrete Mathematics, 1979 AbstractThe concept of quasi-multiplication is used to describe the theory of polynomial sequences, in particular Sheffer and Steffensen sequences.
openaire +1 more source
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
A subexponential-time, polynomial quantum space algorithm for inverting the CM group action
Journal of Mathematical Cryptology, 2020 We present a quantum algorithm which computes group action inverses of the complex multiplication group action on isogenous ordinary elliptic curves, using subexponential time, but only polynomial quantum space.
Jao David +3 more
doaj +1 more source
Law of Large Numbers for Roots of Finite Free Multiplicative Convolution of Polynomials [PDF]
, 2023 Katsunori Fujie, Yuki Ueda
openalex +1 more source
FPGA multi-unit parallel optimization and implementation of post-quantum cryptography CRYSTALS-Kyber
Tongxin xuebao, 2022 In lattice-based post-quantum cryptography, polynomial multiplication is complicated and time-consuming.In order to improve the computational efficiency of lattice cryptography in practical applications, an FPGA multi-unit parallel optimization and ...
Bin LI +3 more
doaj
Fast Implementation of Multiplication on Polynomial Rings [PDF]
, 2022 Boyu Wang, Haiying Gao, Fan Yang
openalex +1 more source
Faster integer and polynomial multiplication using cyclotomic coefficient rings [PDF]
, 2017 David Harvey, Joris van der Hoeven
openalex +1 more source
IEEE AccessNumber Theoretic Transform (NTT) enables speeding up polynomial multiplications, thereby accelerating the implementation of lattice-based post-quantum cryptography (PQC) algorithms.
Duc-Thuan Dam +5 more
doaj +1 more source