We study a static, spherically symmetric system of (2j+ 1) massive Dirac particles, each having angular momentum j, j= 1, 2,..., in a classical gravitational and SU (2) Yang-Mills field. We show that for any black hole solution of the associated Einstein-Dirac-Yang/Mills equations, the spinors must vanish identically outside of the event horizon.

We study extension spaces, cotorsion pairs and their mutations in the cluster category of a marked surface without punctures. Under the one-to-one correspondence between the curves, valued closed curves in the marked surface and the indecomposable objects in the associated cluster category, we prove that the dimension of extension space of two indecomposable objects in the cluster categories equals to the intersection number of the corresponding curves. By using this result, we prove that there are no non-trivial t-structures in the cluster categories when the surface is connected. Based on this result, we give a classification of cotorsion pairs in these categories. Moreover we define the notion of paintings of a marked surface without punctures and their rotations. They are a geometric model of cotorsion pairs and of their mutations respectively.

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!

In this paper, we present a measure of distance in a second-order cone based on a class of continuously differentiable strictly convex functions on ₊₊. Since the distance function has some favorable properties similar to those of the D-function (Censor and Zenios in J. Optim. Theory Appl. 73:451464 [1992]), we refer to it as a quasi D-function. Then, a proximal-like algorithm using the quasi D-function is proposed and applied to the second-cone programming problem, which is to minimize a closed proper convex function with general second-order cone constraints. Like the proximal point algorithm using the D-function (Censor and Zenios in J. Optim. Theory Appl. 73:451464 [1992]; Chen and Teboulle in SIAM J. Optim. 3:538543 [1993]), under some mild assumptions we establish the global convergence of the algorithm expressed in terms of function values; we show that the sequence generated by the