Neutrino Mass, Leptogenesis, and Dark Matter from The Dark Sector with U(1)DU(1)_{D}

I suggest a new extension of the SM by introducing a dark sector which has several new particles and a local $U(1)_{D}$ symmetry. The dark particles bring about the new and interesting physics beyond the SM. The model can generate the tiny neutrino mass by a hybrid see-saw mechanism, achieve the leptogenesis at the TeV scale, and account for the cold dark matter. All of the three things collectively arise from the dark sector. In particular, it is very feasible to test the model predictions and probe the dark sector in near future experiments.Comment: 18 pages, 4 figures, to be published by JHEP. arXiv admin note: text overlap with arXiv:1706.0723

Block encryption of quantum messages

In modern cryptography, block encryption is a fundamental cryptographic primitive. However, it is impossible for block encryption to achieve the same security as one-time pad. Quantum mechanics has changed the modern cryptography, and lots of researches have shown that quantum cryptography can outperform the limitation of traditional cryptography. This article proposes a new constructive mode for private quantum encryption, named $\mathcal{EHE}$, which is a very simple method to construct quantum encryption from classical primitive. Based on $\mathcal{EHE}$ mode, we construct a quantum block encryption (QBE) scheme from pseudorandom functions. If the pseudorandom functions are standard secure, our scheme is indistinguishable encryption under chosen plaintext attack. If the pseudorandom functions are permutation on the key space, our scheme can achieve perfect security. In our scheme, the key can be reused and the randomness cannot, so a $2n$-bit key can be used in an exponential number of encryptions, where the randomness will be refreshed in each time of encryption. Thus $2n$-bit key can perfectly encrypt $O(n2^n)$ qubits, and the perfect secrecy would not be broken if the $2n$-bit key is reused for only exponential times. Comparing with quantum one-time pad (QOTP), our scheme can be the same secure as QOTP, and the secret key can be reused (no matter whether the eavesdropping exists or not). Thus, the limitation of perfectly secure encryption (Shannon's theory) is broken in the quantum setting. Moreover, our scheme can be viewed as a positive answer to the open problem in quantum cryptography "how to unconditionally reuse or recycle the whole key of private-key quantum encryption". In order to physically implement the QBE scheme, we only need to implement two kinds of single-qubit gates (Pauli $X$ gate and Hadamard gate), so it is within reach of current quantum technology.Comment: 13 pages, 1 figure. Prior version appears in eprint.iacr.org(iacr/2017/1247). This version adds some analysis about multiple-message encryption, and modifies lots of contents. There are no changes about the fundamental result

Gap Probability Distribution of the Jacobi Unitary Ensemble: An Elementary Treatment, from Finite nn to Double Scaling

In this paper, we study the gap probability problem of the (symmetric) Jacobi unitary ensemble of Hermitian random matrices, namely the probability that the interval $(-a,a)\:(0<a<1)$ is free of eigenvalues. Using the ladder operator technique for orthogonal polynomials and the associated supplementary conditions, we derive three quantities instrumental in the gap probability, denoted by $H_{n}(a)$, $R_{n}(a)$ and $r_{n}(a)$. We find that each one satisfies a second order differential equation. We show that after a double scaling, the large second order differential equation in the variable $a$ with $n$ as parameter satisfied by $H_{n}(a)$, can be reduced to the Jimbo-Miwa-Okamoto $\sigma$ form of the Painlev\'{e} V equation.Comment: 20 page