Results 41 to 50 of about 3,008 (160)
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
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
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 +3 more sources
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
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
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
Discretisation and Product Distributions in Ring-LWE [PDF]
Journal of Mathematical Cryptology, 2020 Abstract A statistical framework applicable to Ring-LWE was outlined by Murphy and Player (IACR eprint 2019/452). Its applicability was demonstrated with an analysis of the decryption failure probability for degree-1 and degree-2 ciphertexts in the homomorphic encryption scheme of Lyubashevsky, Peikert and Regev ...
Murphy, Sean, Player, Rachel
openaire +3 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
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