Results 1 to 10 of about 3,954 (206)
The Hardness of LWE and Ring-LWE: A Survey. [PDF]
IACR Cryptol. ePrint Arch., 2021 The Learning with Errors (LWE) problem consists of distinguishing linear equations with noise from uniformly sampled values. LWE enjoys a hardness reduction from worst-case lattice problems, which are believed to be hard for classical and quantum ...
David Balbás
openaire +3 more sources
An Efficient and Parallel R-LWE Cryptoprocessor [PDF]
IEEE Transactions on Circuits and Systems II: Express Briefs, 2020 Lattice-based cryptography (LBC) is a promising and efficient public key cryptography scheme whose theoretical foundation usually lies in Learning with Error (LWE) problem and its variant such as Ring-LWE (R-LWE) is the most studied cryptosystem which ...
Dur-E-Shahwar Kundi +2 more
exaly +2 more sources
Revisiting the Hardness of Binary Error LWE [PDF]
Lecture Notes in Computer Science, 2020 Binary error LWE is the particular case of the learning with errors (LWE) problem in which errors are chosen in $\{0,1\}$. It has various cryptographic applications, and in particular, has been used to construct efficient encryption schemes for use in ...
Mehdi Tibouchi +2 more
exaly +3 more sources
Some of the next articles are maybe not open access.
Solving the search-LWE problem over projected lattices
Discrete Applied Mathematics, 2022Katsuki Fujisawa, Masaya Yasuda
exaly
R-LWE-Based Distributed Key Generation and Threshold Decryption
Mathematics, 2022Paz Morillo +2 more
exaly
A public key encryption scheme based on a new variant of LWE with small cipher size
Journal of Systems Architecture, 2021Fagen Li, Ziqing Wang, Haomiao Yang
exaly
A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
Soft Computing, 2017Huiyong Wang, Yong Ding, Tang Shijie
exaly
Module-LWE versus Ring-LWE, Revisited.
IACR Cryptol. ePrint Arch., 2019Yang Wang 0050, Mingqiang Wang
openaire +1 more source