Results 31 to 40 of about 6,148 (198)
Entropic Hardness of Module-LWE from Module-NTRU [PDF]
, 2022 International audienceThe Module Learning With Errors problem (M-LWE) has gained popularity in recent years for its security-efficiency balance, and its hardness has been established for a number of variants.
Corentin Jeudy +7 more
core +2 more sources
On the asymptotic complexity of solving LWE [PDF]
Designs, Codes and Cryptography, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gottfried Herold +2 more
openaire +4 more sources
Hardness of Entropic Module-LWE [PDF]
, 2022 The Learning with Errors (LWE) problem is a versatile basis for building various purpose post-quantum schemes. Goldwasser et al. [ISC 2010] initialized the study of a variant of this problem called the Entropic LWE problem, where the LWE secret is ...
Mingqiang Wang +3 more
core +1 more source
On the complexity of the BKW algorithm on LWE [PDF]
Designs, Codes and Cryptography, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Albrecht, Martin +4 more
openaire +10 more sources
A Masked Ring-LWE Implementation [PDF]
, 2015 Lattice-based cryptography has been proposed as a postquantum public-key cryptosystem. In this paper, we present a masked ring-LWE decryption implementation resistant to first-order side-channel attacks. Our solution has the peculiarity that the entire computation is performed in the masked domain.
Reparaz, Oscar +3 more
openaire +3 more sources
Algebraic algorithms for LWE problems [PDF]
ACM Communications in Computer Algebra, 2015 We analyse the complexity of algebraic algorithms for solving systems of linear equations with \emph{noise}. Such systems arise naturally in the theory of error-correcting codes as well as in computational learning theory. More recently, linear systems with noise have found application in cryptography.
Albrecht, Martin +4 more
openaire +4 more sources
LWE-based identification schemes [PDF]
2011 IEEE Information Theory Workshop, 2011 Some hard problems from lattices, like LWE (Learning with Errors), are particularly suitable for application in Cryptography due to the possibility of using worst-case to average-case reductions as evidence of strong security properties. In this work, we show two LWE-based constructions of zero-knowledge identification schemes and discuss their ...
Rosemberg Silva +2 more
openaire +2 more sources
Discretisation and Product Distributions in Ring-LWE [PDF]
Journal of Mathematical Cryptology, 2020 Abstract 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 encryption scheme of Lyubashevsky, Peikert and Regev ...
Murphy, Sean, Player, Rachel
openaire +4 more sources
Packed Ciphertexts in LWE-based Homomorphic Encryption [PDF]
, 2012 In this short note we observe that the Peikert-Vaikuntanathan-Waters (PVW) method of packing many plaintext elements in a single Regev-type ciphertext, can be used for performing SIMD homomorphic operations on packed ciphertext.
Zvika Brakerski +2 more
core +2 more sources
Effects of Glucose and Homogenization Treatment on the Quality of Liquid Whole Eggs
Foods, 2022 To investigate the effect of glucose on the protein structure, physicochemical and processing properties of liquid whole eggs (LWE) under homogenization, different concentrations of glucose (0.01, 0.02, 0.04, 0.08 g/mL) were added into LWE, followed by ...
Wei Hu +4 more
doaj +1 more source