Results 11 to 20 of about 523,712 (192)
A Masked Ring-LWE Implementation [PDF]
, 2015 Lattice-based cryptography has been proposed as a postquantum public-key cryptosystem. In this paper, we present a masked ring-LWE decryption implementation resistant to first-order side-channel attacks. Our solution has the peculiarity that the entire computation is performed in the masked domain.
Reparaz, Oscar +3 more
core +6 more sources
Lossiness and Entropic Hardness for Ring-LWE [PDF]
, 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 uniformly as prescribed but instead comes from some distribution with sufficient min-entropy. However, the
Zvika Brakerski, Nico Döttling
core +4 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 +5 more sources
Provably Weak Instances of Ring-LWE [PDF]
, 2015 24 pages including computer code, minor modifications and typos ...
Yara Elias +3 more
openaire +5 more sources
Additively Homomorphic Ring-LWE Masking [PDF]
, 2016 In this paper, we present a new masking scheme for ring-LWE decryption. Our scheme exploits the additively-homomorphic property of the existing ring-LWE encryption schemes and computes an additive-mask as an encryption of a random message. Our solution differs in several aspects from the recent masked ring-LWE implementation by Reparaz et al. presented
De Clercq, Ruan +4 more
openaire +3 more sources
Ring-LWE: Enhanced Foundations and Applications
, 2022 Ring Learning With Errors assumption has become an important building block in many modern cryptographic applications, such as (fully) homomorphic encryption and post-quantum cryptosystems like the recently announced NIST CRYSTALS-Kyber public key encryption scheme.
Lin, Chengyu
openaire +4 more sources
Towards a Ring Analogue of the Leftover Hash Lemma [PDF]
Journal of Mathematical Cryptology, 2020 The leftover hash lemma (LHL) is used in the analysis of various lattice-based cryptosystems, such as the Regev and Dual-Regev encryption schemes as well as their leakage-resilient counterparts. The LHL does not hold in the ring setting, when the ring is
Dachman-Soled Dana +3 more
doaj +4 more sources
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 +5 more sources
How (Not) to Instantiate Ring-LWE [PDF]
, 2016 The learning with errors over rings Ring-LWE problem--or more accurately, family of problems--has emerged as a promising foundation for cryptography due to its practical efficiency, conjectured quantum resistance, and provable worst-case hardness: breaking certain instantiations of Ring-LWE is at least as hard as quantumly approximating the Shortest ...
Chris Peikert
openaire +3 more sources
Ring-LWE: Applications to Cryptography and Their Efficient Realization [PDF]
, 2016 The persistent progress of quantum computing with algorithms of Shor and Proos and Zalka has put our present RSA and ECC based public key cryptosystems at peril. There is a flurry of activity in cryptographic research community to replace classical cryptography schemes with their post-quantum counterparts. The learning with errors problem introduced by
Sinha Roy, Sujoy +2 more
openaire +4 more sources