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.

Wave propagation problems arise in a wide range of applications. The energy conserving property is one of the guiding principles for numerical algorithms, in order to minimize the phase or shape errors after long time integration. In this paper, we develop and analyze a local discontinuous Galerkin (LDG) method for solving the wave equation. We prove optimal error estimates, superconvergence toward a particular projection of the exact solution, and the energy conserving property for the semi-discrete formulation. The analysis is extended to the fully discrete LDG scheme, with the centered second-order time discretization (the leap-frog scheme). Our numerical experiments demonstrate optimal rates of convergence and superconvergence. We also show that the shape of the solution, after long time integration, is well preserved due to the energy conserving property.

No abstract uploaded!

On a K-unstable toric variety we show the existence of an optimal destabilising convex function. We show that if this is piecewise linear then it gives rise to a decomposition into semistable pieces analogous to the Harder-Narasimhan filtration of an unstable vector bundle. We also show that if the Calabi flow exists for all time on a toric variety then it minimizes the Calabi functional. In this case the infimum of the Calabi functional is given by the supremum of the normalized Futaki invariants over all destabilising test-configurations, as predicted by a conjecture of Donaldson.

In this work, we study the unsteady axisymmetric mixed convection boundary layer flow and heat transfer of non-Newtonian power law fluid over a cylinder. Different from most classical works, the temperature dependent variable fluid viscosity and thermal conductivity are taken into account in highly coupled velocity and temperature fields. The motion of the fluid can be modeled by a time-dependent nonlinear parabolic system in cylindrical coordinates, which is solved numerically by using Chebyshev spectral method along with the strong stability preserving (SSP) third order Runge-Kutta time discretization. We apply the numerical solver to problems with different power law indices, viscosity parameter, thermal conductivity parameter and Richardson numbers, and compute up to the steady state. The numerical solver is checked by testing the spectral convergence of the numerical approximation to a smooth exact solution of the PDEs with source terms. Moreover, the combined effects of pertinent physical parameters on the flow and heat transfer characteristics are analyzed in detail.