The purpose of the present paper is the solution of the boundary value problems for minimal surfaces when the boundaries are not, or not entirely-fixed Jordan curves but are free to move on prescribed manifolds. At the same time I shall present modifications and simplifications of my previous solution of the Plateau' and Douglas' problem for fixed boundary curves and prescribed topological structure and incidentally discuss certain features of the problem in order to clarify its relation to the theory of conformal mapping. Though based on previous publications, the paper may, except for some references, be read independently.

No abstract uploaded!

No abstract uploaded!

We extend recent results by Pisier on$K$-subcouples, i.e. subcouples of an interpolation couple that preserve the$K$-functional (up to constants) and corresponding notions for quotient couples. Examples include interpolation (in the pointwise sense) and a reinterpretation of the Adamyan-Arov-Krein theorem for Hankel operators.

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.