The goal of this paper is to prove the well-posedness for the governing equations which are used for cylindrical cloaking simulation. A new time-domain finite element scheme is developed to solve the governing equations. Numerical results demonstrating the cloaking phenomenon with the cylindrical cloak are presented. We finally extend the analysis and simulation to an elliptical cloak model.

We propose a derived version of non-archimedean analytic geometry. Intuitively, a derived non-archimedean analytic space consists of an ordinary non-archimedean analytic space equipped with a sheaf of derived rings. Such a naive definition turns out to be insufficient. In this paper, we resort to the theory of pregeometries and structured topoi introduced by Jacob Lurie. We prove the following three fundamental properties of derived non-archimedean analytic spaces: (1) The category of ordinary non-archimedean analytic spaces embeds fully faithfully into the ∞-category of derived non-archimedean analytic spaces. (2) The ∞-category of derived non-archimedean analytic spaces admits fiber products. (3) The ∞-category of higher non-archimedean analytic Deligne-Mumford stacks embeds fully faithfully into the ∞-category of derived non-archimedean analytic spaces. The essential image of this embedding is spanned by n-localic discrete derived non-archimedean analytic spaces. We will further develop the theory of derived non-archimedean analytic geometry in our subsequent works. Our motivations mainly come from intersection theory, enumerative geometry and mirror symmetry.

No abstract uploaded!

No abstract uploaded!

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.