No abstract uploaded!

No abstract uploaded!

No abstract uploaded!

We prove versions of James' weak compactness theorem for polynomials and symmetric multilinear forms of finite type. We also show that a Banach space$X$is reflexive if and only if it admits and equivalent norm such that there exists$x$_{0}≠0 in$X$and a weak-^{*}-open subset$A$of the dual space, satisfying that$x$^{*}⊗$x$_{0}attains its numerical radius. for each$x$^{*}in$A$.

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.