Results 11 to 20 of about 6,148 (198)
The Hardness of LWE and Ring-LWE: A Survey. [PDF]
The Learning with Errors (LWE) problem consists of distinguishing linear equations with noise from uniformly sampled values. LWE enjoys a hardness reduction from worst-case lattice problems, which are believed to be hard for classical and quantum ...
David Balbás
core +3 more sources
The (decisional) learning with errors problem (LWE) asks to distinguish "noisy" inner products of a secret vector with random vectors from uniform. The learning parities with noise problem (LPN) is the special case where the elements of the vectors are bits. In recent years, the LWE and LPN problems have found many applications in cryptography.
Pietrzak, Krzysztof Z ; https://orcid.org/ +1 more
openaire +3 more sources
Fractional LWE: A Nonlinear Variant of LWE [PDF]
Many cryptographic constructions are based on the famous problem LWE [Reg05]. In particular, this cryptographic problem is currently the most relevant to build FHE [GSW13, BV11]. In [BV11], encrypting x consists of randomly choosing a vector \(\varvec{c}\) satisfying \(\langle \varvec{s},\varvec{c}\rangle =x+\textsf {noise}\pmod q\) where \(\varvec{s}\)
Gérald Gavin, Stéphane Bonnevay
core +4 more sources
Lid wiper epitheliopathy: an early sign of dry eye diagnosis [PDF]
ObjectivesThe purpose of this study was to investigate the relationship between the severity of lid wiper epitheliopathy (LWE) and ocular surface features and evaluate the potential of LWE as an early diagnosis indicator of dry eye.MethodsEighty-eight ...
Yuan Gao +4 more
doaj +2 more sources
From Itch to Injury: An Emerging Link Between Allergic Conjunctivitis, Eye Rubbing and Lid Wiper Epitheliopathy [PDF]
Allergic conjunctivitis (AC) is a common inflammatory ocular surface disease characterised by ocular itch, conjunctival redness, tearing, and frequent eye rubbing.
Luke X. Chong +5 more
doaj +2 more sources
A Hybrid of Dual and Meet-in-the-Middle Attack on Sparse and Ternary Secret LWE
The dual attack is one of the most efficient attack algorithms for learning with errors (LWE) problem. Recently, an efficient variant of the dual attack for sparse and small secret LWE was reported by Albrecht (Eurocrypt 2017), which forces some LWE ...
Cheon, Jung Hee, Yongha Son, Minki Hhan
exaly +3 more sources
Provably Weak Instances of Ring-LWE [PDF]
24 pages including computer code, minor modifications and typos ...
Yara Elias +3 more
core +7 more sources
Hardness of LWE on General Entropic Distributions [PDF]
The hardness of the Learning with Errors (LWE) problem is by now a cornerstone of the cryptographic landscape. In many of its applications the so called ``LWE secret'' is not sampled uniformly, but comes from a distribution with some min-entropy. This variant, known as ``Entropic LWE'', has been studied in a number of works, starting with Goldwasser et
Brakerski, Zvika, Döttling, Nico
core +6 more sources
Improvements on Making BKW Practical for Solving LWE †
The learning with errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum–Kalai–Wasserman (BKW) algorithm. This paper presents new improvements of BKW-
Erik Mårtensson +2 more
exaly +3 more sources
Using Variational Quantum Algorithm to Solve the LWE Problem
The variational quantum algorithm (VQA) is a hybrid classical–quantum algorithm. It can actually run in an intermediate-scale quantum device where the number of available qubits is too limited to perform quantum error correction, so it is one of the most
Hong Wang, Zhi Ma, Yang-Yang Fei
exaly +3 more sources

