Results 171 to 180 of about 6,148 (198)
Some of the next articles are maybe not open access.
2018
As an invited speaker of the ACISP 2017 conference, Dongxi Liu recently introduced a new lattice-based encryption scheme (joint work with Li, Kim and Nepal) designed for lightweight IoT applications. The new scheme, which has been submitted to the NIST post-quantum competition, is based on a variant of standard LWE called Compact-LWE, but is claimed to
Jonathan Bootle +2 more
openaire +2 more sources
As an invited speaker of the ACISP 2017 conference, Dongxi Liu recently introduced a new lattice-based encryption scheme (joint work with Li, Kim and Nepal) designed for lightweight IoT applications. The new scheme, which has been submitted to the NIST post-quantum competition, is based on a variant of standard LWE called Compact-LWE, but is claimed to
Jonathan Bootle +2 more
openaire +2 more sources
mrNISC from LWE with polynomial modulus
Information and Computation, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Parallel Implementation of BDD Enumeration for LWE
2016One of the most attractive problems for post-quantum secure cryptographic schemes is the LWE problem. Beside combinatorial and algebraic attacks, LWE can be solved by a lattice-based Bounded Distance Decoding (BDD) approach. We provide the first parallel implementation of an enumeration-based BDD algorithm that employs the Lindner-Peikert and Linear ...
Elena Kirshanova +2 more
openaire +2 more sources
2023
In terms of application of the generalized BKW algorithm, the estimates of security of Ring-LWE symmetric cryptosystem against chosen plaintext attack have been obtained. These estimates allow us to choose the cryptosystem parameters directly proceeding from requirements of its security against chosen plaintext attacks.
openaire +1 more source
In terms of application of the generalized BKW algorithm, the estimates of security of Ring-LWE symmetric cryptosystem against chosen plaintext attack have been obtained. These estimates allow us to choose the cryptosystem parameters directly proceeding from requirements of its security against chosen plaintext attacks.
openaire +1 more source
How (Not) to Instantiate Ring-LWE
2016The learning with errors over rings Ring-LWE problem--or more accurately, family of problems--has emerged as a promising foundation for cryptography due to its practical efficiency, conjectured quantum resistance, and provable worst-case hardness: breaking certain instantiations of Ring-LWE is at least as hard as quantumly approximating the Shortest ...
openaire +3 more sources
LWE from non-commutative group rings
Designs, Codes, and Cryptography, 2021Jincheng Zhuang, Qi Cheng
exaly
AxRLWE: A Multilevel Approximate Ring-LWE Co-Processor for Lightweight IoT Applications
IEEE Internet of Things Journal, 2022Dur-E-Shahwar Kundi +2 more
exaly
Relating Different Polynomial-LWE Problems
2019In this paper we focus on Polynomial Learning with Errors (PLWE). This problem is parametrized by a polynomial and we are interested in relating the hardness of the \(\text {PLWE}^f\) and \(\text {PLWE}^h\) problems for different polynomials f and h.
openaire +3 more sources
Ciphertext-Only Attacks Against Compact-LWE Submitted to NIST PQC Project
Journal of Systems Science and Complexity, 2021Yanbin Pan
exaly
Parallelizable Delegation from LWE
2022Cody Freitag, Rafael Pass, Naomi Sirkin
openaire +3 more sources