Results 171 to 180 of about 5,975 (201)
Some of the next articles are maybe not open access.
Hardness of Entropic Module-LWE
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources
Large Modulus Ring-LWE $$\ge $$ Module-LWE
2017We present a reduction from the module learning with errors problem (MLWE) in dimension \(d\) and with modulus \(q\) to the ring learning with errors problem (RLWE) with modulus \(q^{d}\). Our reduction increases the LWE error rate \(\alpha \) by a quadratic factor in the ring dimension \(n\) and a square root in the module rank \(d\) for power-of-two ...
Martin R. Albrecht, Amit Deo
openaire +2 more sources
Algebraically Structured LWE, Revisited
Journal of Cryptology, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chris Peikert, Zachary Pepin
openaire +4 more sources
Order-LWE and the Hardness of Ring-LWE with Entropic Secrets
2019We propose a generalization of the celebrated Ring Learning with Errors (RLWE) problem (Lyubashevsky, Peikert and Regev, Eurocrypt 2010, Eurocrypt 2013), wherein the ambient ring is not the ring of integers of a number field, but rather an order (a full rank subring).
Bolboceanu, Madalina +3 more
openaire +1 more source
2018
As an invited speaker of the ACISP 2017 conference, Dongxi Liu recently introduced a new lattice-based encryption scheme (joint work with Li, Kim and Nepal) designed for lightweight IoT applications. The new scheme, which has been submitted to the NIST post-quantum competition, is based on a variant of standard LWE called Compact-LWE, but is claimed to
Jonathan Bootle +2 more
openaire +2 more sources
As an invited speaker of the ACISP 2017 conference, Dongxi Liu recently introduced a new lattice-based encryption scheme (joint work with Li, Kim and Nepal) designed for lightweight IoT applications. The new scheme, which has been submitted to the NIST post-quantum competition, is based on a variant of standard LWE called Compact-LWE, but is claimed to
Jonathan Bootle +2 more
openaire +2 more sources
mrNISC from LWE with polynomial modulus
Information and Computation, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2023
In terms of application of the generalized BKW algorithm, the estimates of security of Ring-LWE symmetric cryptosystem against chosen plaintext attack have been obtained. These estimates allow us to choose the cryptosystem parameters directly proceeding from requirements of its security against chosen plaintext attacks.
openaire +1 more source
In terms of application of the generalized BKW algorithm, the estimates of security of Ring-LWE symmetric cryptosystem against chosen plaintext attack have been obtained. These estimates allow us to choose the cryptosystem parameters directly proceeding from requirements of its security against chosen plaintext attacks.
openaire +1 more source
How (Not) to Instantiate Ring-LWE
2016The learning with errors over rings Ring-LWE problem--or more accurately, family of problems--has emerged as a promising foundation for cryptography due to its practical efficiency, conjectured quantum resistance, and provable worst-case hardness: breaking certain instantiations of Ring-LWE is at least as hard as quantumly approximating the Shortest ...
openaire +3 more sources
R-LWE-Based Distributed Key Generation and Threshold Decryption
Mathematics, 2022Paz Morillo +2 more
exaly