Results 51 to 60 of about 3,954 (206)
Direct CCA-Secure KEM and Deterministic PKE from Plain LWE [PDF]
, 2019 We present a particularly simple and efficient CCA-secure public-key encapsulation scheme without random oracles or costly sampling. The construction is direct in the sense that it eschews generic transformations via one-time signatures or MACs typically
Li, Qinyi +3 more
core +1 more source
A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
Journal of Mathematical Cryptology, 2019 Over the past decade, the hybrid lattice-reduction and meet-in-the middle attack (called hybrid attack) has been used to evaluate the security of many lattice-based cryptographic schemes such as NTRU, NTRU Prime, BLISS and more.
Wunderer Thomas
doaj +1 more source
On the Ring-LWE and Polynomial-LWE Problems
, 2018 The Ring Learning With Errors problem (\(\mathsf {RLWE}\)) comes in various forms. Vanilla \(\mathsf {RLWE}\) is the decision dual-\(\mathsf {RLWE}\) variant, consisting in distinguishing from uniform a distribution depending on a secret belonging to the dual \(\mathcal {O}_K^{\vee }\) of the ring of integers \(\mathcal {O}_K\) of a specified number ...
Roșca, Miruna +2 more
openaire +4 more sources
Hardness of Entropic Module-LWE [PDF]
, 2022 The Learning with Errors (LWE) problem is a versatile basis for building various purpose post-quantum schemes. Goldwasser et al. [ISC 2010] initialized the study of a variant of this problem called the Entropic LWE problem, where the LWE secret is ...
Mingqiang Wang +3 more
core
Succinct LWE Sampling, Random Polynomials, and Obfuscation [PDF]
, 2021 We present a construction of indistinguishability obfuscation (iO) that relies on the learning with errors (LWE) assumption together with a new notion of succinctly sampling pseudo-random LWE samples.
Hoeteck Wee +4 more
core
Achieving broadband directivity control with dual corona discharge transducers
Acta AcusticaLoudspeakers inherit their directivity from their geometry and dimensions. Enclosed loudspeakers are omnidirectional in the low frequency range, but their directivity depends on frequency for wavelengths smaller than the radiator size, precluding the ...
Lissek Hervé, Vesal Rahim
doaj +1 more source
On the Hardness of Module-LWE with Binary Secret [PDF]
, 2021 We prove that the Module Learning With Errors (\(\mathrm {M\text {-}LWE}\)) problem with binary secrets and rank d is at least as hard as the standard version of \(\mathrm {M\text {-}LWE}\) with uniform secret and rank k, where the rank increases from k to \(d \ge (k+1)\log _2 q + \omega (\log _2 n)\), and the Gaussian noise from \(\alpha \) to \(\beta
Katharina Boudgoust +3 more
openaire +3 more sources
Ring-LWE in Polynomial Rings [PDF]
, 2012 The Ring-LWE problem, introduced by Lyubashevsky, Peikert, and Regev (Eurocrypt 2010), has been steadily finding many uses in numerous cryptographic applications. Still, the Ring-LWE problem defined in [LPR10] involves the fractional ideal R ∨, the dual of the ring R , which is the source of many theoretical and implementation technicalities. Until now,
Ducas, Léo, Durmus, Alain
openaire +3 more sources
Quantum Key Search for Ternary LWE [PDF]
, 2021 Ternary LWE, i.e., LWE with coefficients of the secret and the error vectors taken from $\{-1, 0, 1\}$, is a popular choice among NTRU-type cryptosystems and some signatures schemes like BLISS and GLP.
Alexander May +2 more
core
On the concrete hardness of Learning with Errors
Journal of Mathematical Cryptology, 2015 The learning with errors (LWE) problem has become a central building block of modern cryptographic constructions. This work collects and presents hardness results for concrete instances of LWE.
Albrecht Martin R. +2 more
doaj +1 more source