Results 81 to 90 of about 6,241 (212)

Optimal multiplication chains for computing a power of a symbolic polynomial [PDF]

, 1971
W. Morven Gentleman
openalex   +1 more source

Matrix Multiplication and Ordinary Bell Polynomial [PDF]

, 2023
Yusuke Imai
openalex   +1 more source

CRYPHTOR: A Memory-Unified NTT-Based Hardware Accelerator for Post-Quantum CRYSTALS Algorithms

IEEE Access
This paper presents the design and FPGA implementation of a hardware accelerator for the Post-Quantum CRYSTALS-Kyber and CRYSTALS-Dilithium algorithms, named CRYPHTOR (CRYstals Polynomial HW acceleraTOR).
Stefano Di Matteo, Ivan Sarno, Sergio Saponara   +2 more
doaj   +1 more source

Galois Field Instructions in the Sandblaster 2.0 Architectrue

International Journal of Digital Multimedia Broadcasting, 2009
This paper presents a novel approach to implementing multiplication of Galois Fields with 2N. Elements of GF(2N) can be represented as polynomials of degree less than N over GF(2).
Mayan Moudgill, Andrei Iancu, Daniel Iancu   +2 more
doaj   +1 more source

Some results on biorthogonal polynomials

International Journal of Mathematics and Mathematical Sciences, 1994
Some biorthogonal polynomials of Hahn and Pastro are derived using a polynomial modification of the Lebesgue measure dθ combined with analytic continuation. A result is given for changing the measures of biorthogonal polynomials on the unit circle by the
Richard W. Ruedemann
doaj   +1 more source

Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials [PDF]

, 2000
Alexei Borodin, Grigori Olshanski
openalex   +1 more source

Multiplication over Extended Galois Field: A New Approach to Find Monic Irreducible Polynomials over Galois Field GF(p^q).

, 2017
Sankhanil Dey, Ranjan Ghosh
openalex   +2 more sources

Multiplication of Polynomials using Discrete Fourier Transformation [PDF]

, 2006
Krzysztof Treyderowski, Christoph Schwarzweller   +1 more
openalex   +1 more source

Parallel Accelerating Number Theoretic Transform for Bootstrapping on a Graphics Processing Unit

Mathematics
The bootstrapping procedure has become the main bottleneck affecting the efficiency of all known fully homomorphic encryption (FHE) schemes. The state-of-the-art scheme for efficient bootstrapping, which is called fully homomorphic encryption over the ...
Huixian Li, Deng Pan, Jinglei Li, Hao Wang   +3 more
doaj   +1 more source

Flip Graphs for Polynomial Multiplication

CoRR
Flip graphs were recently introduced in order to discover new matrix multiplication methods for matrix sizes. The technique applies to other tensors as well. In this paper, we explore how it performs for polynomial multiplication.
Shaoshi Chen, Manuel Kauers
openaire   +2 more sources