Results 41 to 50 of about 6,148 (198)
Estimation of the hardness of the learning with errors problem with a restricted number of samples
Journal of Mathematical Cryptology, 2019 The Learning With Errors (LWE) problem is one of the most important hardness assumptions lattice-based constructions base their security on. In 2015, Albrecht, Player and Scott presented the software tool LWE-Estimator to estimate the hardness of ...
Bindel Nina +3 more
doaj +1 more source
Reduction From Module-SIS to Ring-SIS Under Norm Constraint of Ring-SIS
IEEE Access, 2020 Lattice-based cryptographic scheme is constructed based on hard problems on a lattice such as the short integer solution (SIS) problem and the learning with error (LWE).
Zahyun Koo, Jong-Seon No, Young-Sik Kim
doaj +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 +5 more sources
Lossiness and Entropic Hardness for Ring-LWE
, 2020 The hardness of the Ring Learning with Errors problem (RLWE) is a central building block for efficiency-oriented lattice-based cryptography. Many applications use an “entropic” variant of the problem where the so-called “secret” is not distributed ...
Nico Döttling (17288467) +1 more
core +1 more source
A Toolkit for Ring-LWE Cryptography [PDF]
, 2013 Recent advances in lattice cryptography, mainly stemming from the development of ring-based primitives such as ring-LWE, have made it possible to design cryptographic schemes whose efficiency is competitive with that of more traditional number-theoretic ones, along with entirely new applications like fully homomorphic encryption.
Lyubashevsky, Vadim +2 more
openaire +4 more sources
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
, 2019 In recent years, researchers have made tremendous progress to address an important question of how to provide security and privacy in Internet of Things systems.
Aarti Amod Agarkar (19129525) +1 more
core +1 more source
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
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 +4 more sources