Let G be a connected reductive complex algebraic group, and E a complex elliptic curve. Let GE denote the connected component of the trivial bundle in the stack of semistable Gbundles on E. We introduce a complex analytic uniformization of G_E by adjoint quotients of reductive subgroups of the loop group of G. This can be viewed as a nonabelian version of the classical complex analytic uniformization E=C^∗/q^Z. We similarly construct a complex analytic uniformization of G itself via the exponential map, providing a nonabelian version of the standard isomorphism C^∗= C/Z, and a complex analytic uniformization of G_E generalizing the standard presentation E = C/(Z ⊕ Zτ). Finally, we apply these results to the study of sheaves with nilpotent singular support. As an application to Betti geometric Langlands conjecture in genus 1, we define a functor from Sh_N(G_E) (the semistable part of the automorphic category) to IndCoh_{Nˇ}(Locsys_{Gˇ}(E)) (the spectral category).

No abstract uploaded!

In the first part of this paper, we study Koszul property of directed graded categories. In the second part of this paper, we prove a general criterion for an infinite directed category to be Koszul. We show that infinite directed categories in the theory of representation stability are Koszul over a field of characteristic zero

Error reconciliation is an important technique for learning with error (LWE) and ring-LWE (RLWE)-based constructions. In this paper, we present a comparison analysis on two error reconciliation-based RLWE key exchange protocols: Ding et al. in 2012 (DING12) and Bos et al. in 2015 (BCNS15). We take them as examples to explain the core idea of error reconciliation, building key exchange over RLWE problem, implementation and real-world performance, and compare them comprehensively. We also analyse a LWE key exchange 'Frodo' that uses an improved error reconciliation mechanism in BCNS15. To the best of our knowledge, our work is the first to present at least 128-bit classic (80-bit quantum) and 256-bit classic (> 200-bit quantum) secure parameter choices for DING12 with efficient portable C/C++ implementations. Benchmark shows that our efficient implementation is 11× faster than BCNS15 and one key exchange execution only costs 0.07 ms on a four-year-old middle range CPU. Error reconciliation is 1.57× faster than BCNS15.

No abstract uploaded!