Results 111 to 120 of about 5,975 (201)
Lattice Decoding Attacks on Binary LWE [PDF]
We consider the binary-LWE problem, which is the learning with errors problem when the entries of the secret vector are chosen from $\{ 0, 1\}$ or $\{ -1, 0, 1 \}$ (and the error vector is sampled from a discrete Gaussian distribution).
Steven D. Galbraith, Shi Bai
core
Structured Module Lattice-based Cryptography
The ongoing transition to Post-Quantum Cryptography (PQC) has highlighted the need for cryptographic schemes that offer high security, strong performance, and fine-grained parameter selection.
Joppe W. Bos +3 more
doaj +1 more source
Practical MP-LWE-based encryption balancing security-risk vs. efficiency [PDF]
Middle-Product Learning With Errors (MP-LWE) is a variant of the LWE problem introduced at CRYPTO 2017 by Rosca et al [RSSS17]. Asymptotically, the theoretical results of [RSSS17] suggest that MP-LWE gives lattice-based public-key cryptosystems offering ...
Raymond K. Zhao +2 more
core
A rare medicinal fungus called Taiwanofungus camphoratus gives people resistance to illness. In order to effectively obtain high−quality T. camphoratus mycelia, we added Cymbopogon citratus (lemongrass) water extract (LWE), which was prepared using hot ...
Yeyan Wen +6 more
doaj +1 more source
Klepto for Ring-LWE Encryption [PDF]
D. Xiao (Dianyan), Y. Yu (Yang)
openaire +3 more sources
Evasive LWE Assumptions: Definitions, Classes, and Counterexamples [PDF]
The evasive LWE assumption, proposed by Wee [Eurocrypt\u2722 Wee] for constructing a lattice-based optimal broadcast encryption, has shown to be a powerful assumption, adopted by subsequent works to construct advanced primitives ranging from ABE variants
Ivy K. Y. Woo, Chris Brzuska, Akin Ünal
core +1 more source
LWE and provably secure key exchange schemes
The threat of large-scale quantum computers motivates cryptographers to base cryptosystems on problems believed to be resistant against quantum computers.
Václavek, Jan
core
The Complexity of Algebraic Algorithms for LWE
Arora & Ge introduced a noise-free polynomial system to compute the secret of a Learning With Errors (LWE) instance via linearization. Albrecht et al. later utilized the Arora-Ge polynomial model to study the complexity of Gröbner basis computations on LWE polynomial systems under the assumption of semi-regularity.
openaire +4 more sources
With climate change, selection for water efficiency and heat resilience are vitally important. We undertook this study to determine the effect of chronic cyclic heat stress (HS) on the hypothalamic expression profile of water homeostasis‐associated ...
Loujain Aloui +7 more
doaj +1 more source
Identity-Based Online/Offline Encryption Scheme from LWE
With quantum computers, the quantum resistance of cryptographic systems has gradually attracted attention. To overcome the shortcoming of existing identity-based encryption (IBE) schemes in resisting quantum attacks, we introduce an IBE scheme based on ...
Binger Zuo +3 more
doaj +1 more source

