We give an elementary proof of the formula χ($K$^{$n$}A)=$n$^{3}σ($n$) for the Euler characteristic of the generalized Kummer variety$K$^{$n$}$A$, where σ($n$) denotes the sum of divisors function.

We give a sufficient condition on a Lévy measure$μ$which ensures that the generator$L$of the corresponding pure jump Lévy process is (locally) hypoelliptic, i.e., $\mathop {\mathrm {sing\,supp}}u\subseteq \mathop {\mathrm {sing\,supp}}Lu$ for all admissible$u$. In particular, we assume that $\mu|_{\mathbb {R}^{d}\setminus \{0\}}\in C^{\infty}(\mathbb {R}^{d}\setminus \{0\})$ . We also show that this condition is necessary provided that $\mathop {\mathrm {supp}}\mu$ is compact.

Multivariate public key cryptosystems are being focused on as candidates for post-quantum cryptography. Rainbow is one of the most efficient signature schemes in multivariate public key cryptosystems. The main drawback of Rainbow is that their key size is much larger than that of RSA and ECC. In this paper, we propose an efficient variant of Rainbow that has a shorter secret key (and thus generates signatures faster) than the corresponding original Rainbow. In our scheme, we divide each layer of Rainbow into smaller blocks by using diagonal matrix representations. The size of the smaller blocks can be flexibly selected, and this enables us to carefully choose secure parameters so that our proposed scheme is secure against known attacks such as rank attacks, direct attacks, and UOV attack. We estimate that the secret key size of our proposed scheme with 100-bit security is smaller by about 40% than that of the original Rainbow. In addition, an implementation of our scheme in the C language is seen to generate signature faster by 40%.

No abstract uploaded!

No abstract uploaded!