Results 131 to 140 of about 3,008 (160)

Algebraic Algorithms for LWE Problems

open access: yes, 2014
We analyse the complexity of algebraic algorithms for solving systems of linear equations with \emph{noise}. Such systems arise naturally in the theory of error-correcting codes as well as in computational learning theory.
Carlos Cid   +8 more
core  

On the Quantum Equivalence between S|LWE⟩ and ISIS

open access: yes
Chen, Liu, and Zhandry [CLZ22] introduced the problems S|LWE⟩ and C|LWE⟩ as quantum analogues of the Learning with Errors problem, designed to construct quantum algorithms for the Inhomogeneous Short Integer Solution (ISIS) problem.
Chailloux, André, Hermouet, Paul
core  

Hardness of Entropic Module-LWE

Theoretical Computer Science
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jincheng Zhuang
exaly   +3 more sources

Large Modulus Ring-LWE $$\ge $$ Module-LWE

2017
We 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, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chris Peikert, Zachary Pepin
openaire   +3 more sources

Order-LWE and the Hardness of Ring-LWE with Entropic Secrets

2019
We 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

mrNISC from LWE with polynomial modulus

Information and Computation, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Cryptanalysis of Compact-LWE

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   +1 more source

Access Control Encryption Based on LWE

Proceedings of the 4th ACM International Workshop on ASIA Public-Key Cryptography, 2017
Damgard et al. proposed a new primitive called access control encryption (ACE) [6] which not only protects the privacy of the message, but also controls the ability of the sender to send the message. We will give a new construction based on the Learning with Error (LWE) assumption [12], which is one of the two open problems in [6].
Gaosheng Tan   +3 more
openaire   +1 more source

???????????? ?????????????????? ???????????????????????? ?????????????????????? Ring-LWE ???????????????????????? ?????????? ?? ?????????????????? ???????????????? ??????????????

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

Home - About - Disclaimer - Privacy