Results 91 to 100 of about 6,241 (212)

A lower bound for polynomial multiplication

open access: yesTheoretical Computer Science, 1985
We prove that multiplying two third degree polynomials over \({\mathbb{Z}}_ 2\) requires nine multiplications. This bound is tight.
openaire   +2 more sources

A Radix-2/4/8-Based Pipelined NTT/INTT Architecture for Homomorphic Encryption

open access: yesIEEE Access
Homomorphic encryption (HE) is a cryptographic scheme that enables data to be stored, transmitted, and processed in encrypted form, making it an effective solution for data-sensitive applications such as defense and healthcare.
Ju-Hyung Lee   +2 more
doaj   +1 more source

Parallel multiplication and powering of polynomials

open access: yesJournal of Symbolic Computation, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Home - About - Disclaimer - Privacy