Results 41 to 50 of about 6,241 (212)

FPGA-Based Hardware Accelerator for Leveled Ring-LWE Fully Homomorphic Encryption

open access: yesIEEE Access, 2020
Fully homomorphic encryption (FHE) allows arbitrary computation on encrypted data and has great potential in privacy-preserving cloud computing and securely outsource computational tasks.
Yang Su   +3 more
doaj   +1 more source

WHAT IS...A Multiple Orthogonal Polynomial?

open access: yesNotices of the American Mathematical Society, 2016
This is an extended version of our note in the Notices of the American Mathematical Society 63 (2016), no. 9, in which we explain what multiple orthogonal polynomials are and where they appear in various applications.
Martínez-Finkelshtein, A.   +1 more
openaire   +1 more source

Straggler- and Adversary-Tolerant Secure Distributed Matrix Multiplication Using Polynomial Codes

open access: yesEntropy, 2023
Large matrix multiplications commonly take place in large-scale machine-learning applications. Often, the sheer size of these matrices prevent carrying out the multiplication at a single server.
Eimear Byrne   +2 more
doaj   +1 more source

Simple Multivariate Polynomial Multiplication

open access: yesJournal of Symbolic Computation, 1994
Let \(u= u(x_1, \dots, x_m)\) and \(v= v(x_1, \dots, x_m)\) be \(m\)-variate polynomials over a field \(F\) and let \(N= c^m\), where \(c\) is chosen so that \(c\geq 2\deg_{x_i} (u)+ 1,2 \deg_{x_i} (v)+ 1\) \((1\leq i\leq m)\). It is known that the product \(uv\) can be computed in time \(O(N \log N\log \log N)\).
openaire   +1 more source

A Flexible Hardware Accelerator for Booth Polynomial Multiplier

open access: yesApplied Sciences
This article presents a parameterized/flexible hardware accelerator design tailored for the Booth polynomial multiplication method. The flexibility is achieved by allowing users to compute multiplication operations across various operand lengths ...
Omar S. Sonbul
doaj   +1 more source

Secure Collaborative Publicly Verifiable Computation

open access: yesIEEE Access, 2017
Publicly Verifiable Computation (PVC) enables computationally weak trusted sources to outsource several computations to some more powerful public untrusted clouds.
Qiang Wang   +4 more
doaj   +1 more source

Ehrhart polynomial and multiplicity Tutte polynomial

open access: yes, 2011
6 pages, 1 ...
D'Adderio, Michele, Moci, Luca
openaire   +2 more sources

Implementasi dan Pengukuran Kinerja Operasi Aritmatika Finite Field Berbasis Polinomial Biner

open access: yesJuTISI (Jurnal Teknik Informatika dan Sistem Informasi), 2015
Cryptography is one of the security techniques that secure information confidentiality and information integrity while electronic transaction processing.
Wenny Franciska Senjaya, Budi Rahardjo
doaj   +1 more source

Home - About - Disclaimer - Privacy