Results 21 to 30 of about 2,794 (176)
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
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
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
R-LWE-Based Distributed Key Generation and Threshold Decryption
Mathematics, 2022 Ever since the appearance of quantum computers, prime factoring and discrete logarithm-based cryptography have been questioned, giving birth to the so-called post-quantum cryptography.
Ferran Alborch +2 more
doaj +1 more source
The polynomial learning with errors problem and the smearing condition
Journal of Mathematical Cryptology, 2022 As quantum computing advances rapidly, guaranteeing the security of cryptographic protocols resistant to quantum attacks is paramount. Some leading candidate cryptosystems use the learning with errors (LWE) problem, attractive for its simplicity and ...
Babinkostova Liljana +4 more
doaj +1 more source
Discretisation and Product Distributions in Ring-LWE
Journal of Mathematical Cryptology, 2020 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 ...
Murphy Sean, Player Rachel
doaj +1 more source
(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 +1 more source
On Advances of Lattice-Based Cryptographic Schemes and Their Implementations
Cryptography, 2022 Lattice-based cryptography is centered around the hardness of problems on lattices. A lattice is a grid of points that stretches to infinity. With the development of quantum computers, existing cryptographic schemes are at risk because the underlying ...
Harshana Bandara +3 more
doaj +1 more source
Security considerations for Galois non-dual RLWE families [PDF]
, 2017 We explore further the hardness of the non-dual discrete variant of the Ring-LWE problem for various number rings, give improved attacks for certain rings satisfying some additional assumptions, construct a new family of vulnerable Galois number fields ...
D Micciancio +13 more
core +2 more sources