No abstract uploaded!

No abstract uploaded!

LWE/RLWE-based cryptosystems require sampling error term from discrete Gaussian distribution. However, some existing samplers are somehow slow under certain circumstances therefore efficiency of such schemes is restricted. In this paper, we introduce a more efficient discretized Gaussian sampler based on ziggurat sampling algorithm. We also analyze statistical quality of our sampler to prove that it can be adopted in LWE/RLWE-based cryptosystems. Compared with ziggurat-based sampler by Buchmann et al. related samplers by Peikert, Ducas et al. and Knuth-Yao, our sampler achieves more than 2x speedup when standard deviation is large. This can benefit constructions rely on noise flooding (e.g., homomorphic encryption). We also present two applications: First, we use our sampler to optimize the RLWE-based authenticated key exchange (AKE) protocol by Zhang et al. We achieve 1.14x speedup on total runtime of this protocol over major parameter choices. Second, we give practical post-quantum Transport Layer Security (TLS) ciphersuite. Our ciphersuite inherits advantages from TLS and the optimized AKE protocol. Performance of our proof-of-concept implementation is close to TLS v1.2 ciphersuites and one post-quantum TLS construction.

We prove new inequalities of the Lieb-Thirring type on the eigenvalues of Schrdinger operators in wave guides with local perturbations. The estimates are optimal in the weak-coupling case. To illustrate their applications, we consider, in particular, a straight strip and a straight circular tube with either mixed boundary conditions or boundary deformations.

We consider two-stage hybrid protocols that combine quantum resources and classical resources to generate classical correlations shared by two separated players. Our motivation is twofold. First, in the near future, the scale of quantum information processing is quite limited, and when quantum resource available is not sufficient for certain tasks, a possible way to strengthen the capability of quantum schemes is introducing extra classical resources. We analyze the mathematical structures of these hybrid protocols, and characterize the relation between the amount of quantum resources and classical resources needed. Second, a fundamental open problem in communication complexity theory is to describe the advantage of sharing prior quantum entanglement over sharing prior randomness, which is still widely open. It turns out that our quantum and classical hybrid protocols provide new insight into this important problem.