Results 21 to 30 of about 342 (169)
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
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
Provably Weak Instances of Ring-LWE [PDF]
, 2015 24 pages including computer code, minor modifications and typos ...
Yara Elias +3 more
openaire +3 more sources
Cold Boot Attacks on Ring and Module LWE Keys Under the NTT
Transactions on Cryptographic Hardware and Embedded Systems, 2018 In this work, we consider the ring- and module- variants of the LWE problem and investigate cold boot attacks on cryptographic schemes based on these problems, wherein an attacker is faced with the problem of recovering a scheme’s secret key from a noisy
Martin R. Albrecht +2 more
doaj +1 more source
Efficient Software Implementation of Ring-LWE Encryption [PDF]
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2015, 2015 © 2015 EDAA. Present-day public-key cryptosystems such as RSA and Elliptic Curve Cryptography (ECC) will become insecure when quantum computers become a reality. This paper presents the new state of the art in efficient software implementations of a post-quantum secure public-key encryption scheme based on the ring-LWE problem.
De Clercq, Ruan +3 more
openaire +4 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 +2 more sources
Pseudorandomness of ring-LWE for any ring and modulus [PDF]
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017 We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to decision (Ring-)LWE. This extends to decision all the worst-case hardness results that were previously known for the search version, for the same or even better parameters and with no algebraic restrictions on the modulus or number field.
Chris Peikert +2 more
openaire +2 more sources
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
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
Ring-LWE Cryptography for the Number Theorist [PDF]
, 2016 20 ...
Elias, Y. +3 more
openaire +4 more sources