Results 21 to 30 of about 302 (149)
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 +2 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 +2 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
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
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 +2 more sources
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
Compact Ring-LWE Cryptoprocessor [PDF]
, 2014 In this paper we propose an efficient and compact processor for a ring-LWE based encryption scheme. We present three optimizations for the Number Theoretic Transform NTT used for polynomial multiplication: we avoid pre-processing in the negative wrapped convolution by merging it with the main algorithm, we reduce the fixed computation cost of the ...
Sinha Roy, Sujoy +4 more
openaire +2 more sources
Polar coding for Ring-LWE-based public key encryption
Cryptography and Communications, 2022 AbstractThe ring learning with errors (RLWE) problem can be used to construct efficient post-quantum public key encryption schemes. An error distribution, normally a Gaussian-like distribution, is involved in the RLWE problem. In this work we focus on using polar codes to alleviate a natural trade-off present in RLWE public key encryption schemes ...
Jiabo Wang, Cong Ling
openaire +1 more source
High-Secure Fingerprint Authentication System Using Ring-LWE Cryptography
IEEE Access, 2019 This paper presents a high-secure fingerprint authentication system using ring learning with errors (ring-LWE) cryptography to protect users' fingerprint data more securely.
Tuy Nguyen Tan, Hanho Lee
doaj +1 more source
Provably Weak Instances of Ring-LWE [PDF]
, 2015 24 pages including computer code, minor modifications and typos ...
Elias, Yara +3 more
openaire +2 more sources