Related papers: Algebraic aspects of solving Ring-LWE, including r…
The Learning with Errors problem (LWE) is one of the main candidates for post-quantum cryptography. At Asiacrypt 2017, coded-BKW with sieving, an algorithm combining the Blum-Kalai-Wasserman algorithm (BKW) with lattice sieving techniques,…
In this paper, we study the Learning With Errors problem and its binary variant, where secrets and errors are binary or taken in a small interval. We introduce a new variant of the Blum, Kalai and Wasserman algorithm, relying on a…
The Learning with Errors (LWE) problem receives much attention in cryptography, mainly due to its fundamental significance in post-quantum cryptography. Among its solving algorithms, the Blum-Kalai-Wasserman (BKW) algorithm, originally…
At CRYPTO 2015, Kirchner and Fouque claimed that a carefully tuned variant of the Blum-Kalai-Wasserman (BKW) algorithm (JACM 2003) should solve the Learning with Errors problem (LWE) in slightly subexponential time for modulus…
The Learning with Errors (\LWE) problem has been widely utilized as a foundation for numerous cryptographic tools over the years. In this study, we focus on an algebraic variant of the \LWE problem called \emph{Group ring} \LWE ($\GRLWE$).…
The ring and polynomial learning with errors problems (Ring-LWE and Poly-LWE) have been proposed as hard problems to form the basis for cryptosystems, and various security reductions to hard lattice problems have been presented. So far…
First principles calculations based on many-electron perturbation theory methods, such as the \textit{ab initio} GW and GW plus Bethe-Salpeter equation (GW-BSE) approach, are reliable ways to predict quasiparticle and optical properties of…
We adapt the Bender-Wu algorithm to solve perturbatively but very efficiently the eigenvalue problem of "relativistic" quantum mechanical problems whose Hamiltonians are difference operators of the exponential-polynomial type. We implement…
This work presents a model reduction approach to the inverse problem in the application of subsurface flows. For the Bayesian inverse problem, the forward model needs to be repeatedly computed for a large number of samples to get a…
This paper studies the nonconvex quadratic root-difference minimization under elliptic annulus constraints {\rm (QR)}. We first establish the Annulus Brickman theorem and equivalently reformulate {\rm (QR)} as a 2-dimensional convex problem…
The Learning with Errors (LWE) problem is the fundamental backbone of modern lattice based cryptography, allowing one to establish cryptography on the hardness of well-studied computational problems. However, schemes based on LWE are often…
Finding the minimal structural assumptions that empower sample-efficient learning is one of the most important research directions in Reinforcement Learning (RL). This paper advances our understanding of this fundamental question by…
This study focuses on addressing the challenge of solving the reduced biquaternion equality constrained least squares (RBLSE) problem. We develop algebraic techniques to derive real and complex solutions for the RBLSE problem by utilizing…
In this paper, we go on Rui-Xu's work on cyclotomic Birman-Wenzl algebras $\W_{r, n}$ in \cite{RX}. In particular, we use the representation theory of cellular algebras in \cite{GL} to classify the irreducible $\W_{r, n}$-modules for all…
In this research, a novel adaptive filtering algorithm is proposed for complex domain signal processing. The proposed algorithm is based on Wirtinger calculus and is called as q-Complex Least Mean Square (q-CLMS) algorithm. The proposed…
A complete system of pairwise orthogonal minimal idempotents for Birman-Murakami-Wenzl algebras is obtained by a consecutive evaluation of a rational function in several variables on sequences of quantum contents of up-down tableaux. A…
In this brief, we improve the Broad Learning System (BLS) [7] by reducing the computational complexity of the incremental learning for added inputs. We utilize the inverse of a sum of matrices in [8] to improve a step in the pseudoinverse…
In this work, we present a novel and more efficient approach to constructing the relativistic BKW (Bobylev, Krook, and Wu) solution. By introducing a class of ansatz functions for the distribution function, we demonstrate that within this…
We prove the equivalence between the Ring Learning With Errors (RLWE) and the Polynomial Learning With Errors (PLWE) problems for the maximal totally real subfield of the $2^r 3^s$-th cyclotomic field for $r \geq 3$ and $s \geq 1$.…
The Learning-With-Errors (LWE) problem is a fundamental computational challenge with implications for post-quantum cryptography and computational learning theory. Here we propose a quantum-classical hybrid algorithm with Ising model to…