Results 21 to 30 of about 243,099 (282)
On the condition number of the Vandermonde matrix of the nth cyclotomic polynomial
Recently, Blanco-Chacón proved the equivalence between the Ring Learning With Errors and Polynomial Learning With Errors problems for some families of cyclotomic number fields by giving some upper bounds for the condition number Cond(Vn) of the ...
Scala Antonio J. Di +2 more
doaj +1 more source
Homomorphic Encryption (HE) allows performing specific algebraic computations on encrypted data without the need for decryption. For this reason, HE is emerging as a strong privacy-preserving solution in cloud computing environments since it allows to ...
Stefano Di Matteo +2 more
doaj +1 more source
The Ring Learning With Errors Problem: Spectral Distortion
We answer a question posed by Y. Elias et al. in [8] about possible spectral distortions of algebraic numbers. We provide a closed form for the spectral distortion of certain classes of cyclotomic polynomials. Moreover, we present a bound on the spectral distortion of cyclotomic polynomials.
Babinkostova, L. +4 more
openaire +2 more sources
Post-quantum encryption technology based on BRLWE for internet of things
With the development of quantum computers, the classical public key encryption system is not capable enough to guarantee the communication security of internet of things (IoT).Because the mathematical puzzles which post-quantum encryption algorithms are ...
Yitian GAO, Liquan CHEN, Tianyang TU, Yuan GAO, Qianye CHEN
doaj +3 more sources
The Ring-LWE Problem in Lattice-Based Cryptography: The Case of Twisted Embeddings
Several works have characterized weak instances of the Ring-LWE problem by exploring vulnerabilities arising from the use of algebraic structures. Although these weak instances are not addressed by worst-case hardness theorems, enabling other ring ...
Jheyne N. Ortiz +4 more
doaj +1 more source
Obfuscating Conjunctions under Entropic Ring LWE [PDF]
We show how to securely obfuscate conjunctions, which are functions f(x[subscript 1], . . . , x[subscript n]) = ∧[subscript i∈I] y[superscript i] where I ⊆ [n] and each literal y[subscript i] is either just x[subscript i] or ¬x[subscript i] e.g., f(x ...
Brakerski, Zvika +3 more
core +3 more sources
NTRU-type fully homomorphic encryption scheme without key switching
In order to construct a fully homomorphic encryption scheme based on NTRU cryptosystem from ring learning with errors, noise growth and homomorphic property in the NTRU cryptosystem were analyzed. The con-cept of zero homomorphic encryption was introdced
Xin-xia SONG +2 more
doaj +3 more sources
Lattice-Based Group Signature with Message Recovery for Federal Learning
Federal learning and privacy protection are inseparable. The participants in federated learning need to be the targets of privacy protection. On the other hand, federated learning can also be used as a tool for privacy attacks.
Yongli Tang +3 more
doaj +1 more source
Graph Networks as a Universal Machine Learning Framework for Molecules and Crystals [PDF]
Graph networks are a new machine learning (ML) paradigm that supports both relational reasoning and combinatorial generalization. Here, we develop universal MatErials Graph Network (MEGNet) models for accurate property prediction in both molecules and ...
Chen, Chi +4 more
core +4 more sources
A three-party authenticated key exchange protocol enables two entities to agree on a session key with the help of a dedicated server over a public channel. Shor’s algorithm is a big threat to existing authenticated key exchange protocols.
Dharminder Chaudhary +2 more
doaj +1 more source

