Results 11 to 20 of about 357 (170)
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 +5 more sources
(In)Security of Ring-LWE Under Partial Key Exposure
Journal of Mathematical Cryptology, 2020 We initiate the study of partial key exposure in Ring-LWE (RLWE)-based cryptosystems. Specifically, we (1) Introduce the search and decision Leaky R-LWE assumptions (Leaky R-SLWE, Leaky R-DLWE), to formalize the hardness of search/decision RLWE under ...
Dachman-Soled Dana +3 more
doaj +4 more sources
Practical CCA2-Secure and Masked Ring-LWE Implementation
Transactions on Cryptographic Hardware and Embedded Systems, 2018 During the last years public-key encryption schemes based on the hardness of ring-LWE have gained significant popularity. For real-world security applications assuming strong adversary models, a number of practical issues still need to be addressed.
Tobias Oder +3 more
doaj +4 more sources
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 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
openaire +3 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 +4 more sources
Towards an efficient LWE‐based fully homomorphic encryption scheme
IET Information Security, 2022 The security of most early fully homomorphic encryption schemes was based on the hardness of the Learning with Errors (LWE) problem. These schemes were inefficient in terms of per gate computations and public‐key size.
Uddipana Dowerah +1 more
doaj +1 more source
A Ring-LWE-based digital signature inspired by Lindner–Peikert scheme
Journal of Mathematical Cryptology, 2022 In this article, we give a digital signature by using Lindner–Peikert cryptosystem. The security of this digital signature is based on the assumptions about hardness of Ring-LWE and Ring-SIS problems, along with providing public key and signature of ...
Sharafi Javad, Daghigh Hassan
doaj +1 more source
Provably Weak Instances of Ring-LWE [PDF]
, 2015 24 pages including computer code, minor modifications and typos ...
Yara Elias +3 more
openaire +4 more sources
A framework for cryptographic problems from linear algebra
Journal of Mathematical Cryptology, 2020 We introduce a general framework encompassing the main hard problems emerging in lattice-based cryptography, which naturally includes the recently proposed Mersenne prime cryptosystem, but also problems coming from code-based cryptography.
Bootland Carl +3 more
doaj +1 more source