Research on key mismatch attacks against lattice-based KEMs is an important part of the cryptographic assessment of the ongoing NIST standardization of post-quantum cryptography. There have been a number of these attacks to date. However, a unified method to evaluate these KEMs’ resilience under key mismatch attacks is still missing. Since the key index of efficiency is the number of queries needed to successfully mount such an attack, in this paper, we propose and develop a systematic approach to find lower bounds on the minimum average number of queries needed for such attacks. Our basic idea is to transform the problem of finding the lower bound of queries into finding an optimal binary recovery tree (BRT), where the computations of the lower bounds become essentially the computations of a certain Shannon entropy. The optimal BRT approach also enables us to understand why, for some lattice-based NIST candidate KEMs, there is a big gap between the theoretical bounds and bounds observed in practical attacks, in terms of the number of queries needed. This further leads us to propose a generic improvement method for these existing attacks, which are confirmed by our experiments. Moreover, our proposed method could be directly used to improve the side-channel attacks against CCA-secure NIST candidate KEMs.

In this paper, high order central finite difference schemes in a finite interval are analyzed for the diffusion equation. Boundary conditions of the initial-boundary value problem (IBVP) are treated by the simplified inverse Lax-Wendroff (SILW) procedure. For the fully discrete case, a third order explicit Runge-Kutta method is used as an example for the analysis. Stability is analyzed by both the GKS (Gustafsson, Kreiss and Sundstr\"om) theory and the eigenvalue visualization method on both semi-discrete and fully discrete schemes. The two different analysis techniques yield consistent results. Numerical tests are performed to demonstrate and validate the analysis results.

No abstract uploaded!

Let σ be the geodesic inversion on a Heisenberg type group$N$with homogeneous dimension$Q$, and denote by$S$the jacobian of σ. We prove that, for $$ - \frac{1}{2}Q< \alpha< \frac{1}{2}Q$$ , the operators $$T_\alpha :f \mapsto S^{1/2 - \alpha /Q} (f \circ \sigma )$$ are bounded on certain homogeneous Sobolev spaces $$\mathcal{H}^\alpha (N)$$ if and only if$N$is an Iwasawa$N$-group.

We consider a general class of symmetric or Hermitian random band matrices $H=(h_{xy})_{x,y \in \llbracket 1,N\rrbracket^d}$ in any dimension $d\ge 1$, where the entries are independent, centered random variables with variances $s_{xy}=\mathbb E|h_{xy}|^2$. We assume that $s_{xy}$ vanishes if $|x-y|$ exceeds the band width $W$, and we are interested in the mesoscopic scale with $1\ll W\ll N$. Define the {\it{generalized resolvent}} of $H$ as $G(H,Z):=(H - Z)^{-1}$, where $Z$ is a deterministic diagonal matrix with entries $Z_{xx}\in \mathbb C_+$ for all $x$. Then we establish a precise high-probability bound on certain averages of polynomials of the resolvent entries. As an application of this fluctuation averaging result, we give a self-contained proof for the delocalization of random band matrices in dimensions $d\ge 2$. More precisely, for any fixed $d\ge 2$, we prove that the bulk eigenvectors of $H$ are delocalized in certain averaged sense if $N\le W^{1+\frac{d}{2}}$. This improves the corresponding results in \cite{HeMa2018} under the assumption $N\ll W^{1+\frac{d}{d+1}}$, and in \cite{ErdKno2013,ErdKno2011} under the assumption $N\ll W^{1+\frac{d}{6}}$. For 1D random band matrices, our fluctuation averaging result was used in \cite{PartII,PartI} to prove the delocalization conjecture and bulk universality for random band matrices with $N\ll W^{4/3}$.