The Convex Closure of the Output Entropy of Infinite Dimensional Channels and the Additivity Problem

The continuity properties of the convex closure of the output entropy of infinite dimensional channels and their applications to the additivity problem are considered. The main result of this paper is the statement that the superadditivity of the convex closure of the output entropy for all finite dimensional channels implies the superadditivity of the convex closure of the output entropy for all infinite dimensional channels, which provides the analogous statements for the strong superadditivity of the EoF and for the additivity of the minimal output entropy. The above result also provides infinite dimensional generalization of Shor's theorem stated equivalence of different additivity properties. The superadditivity of the convex closure of the output entropy (and hence the additivity of the minimal output entropy) for two infinite dimensional channels with one of them a direct sum of noiseless and entanglement-breaking channels are derived from the corresponding finite dimensional results. In the context of the additivity problem some observations concerning complementary infinite dimensional channels are considered.Comment: 24 page

Singularity Theory and Integrable Systems

The workshop brought together three very different areas of mathematics, namely singularity theory, integrable systems and quantum cohomology. They are linked by their applications in topological quantum field theory and by constructions of (often isomorphic) Frobenius manifolds. The first and second are related by a version of mirror symmetry, the link of the second and third has attracted much attention. The connection of the first and third is the least developed and was at the focus of the workshop

Higher Cluster Categories and QFT Dualities

We present a unified mathematical framework that elegantly describes minimally SUSY gauge theories in even dimension, ranging from $6d$ to $0d$, and their dualities. This approach combines recent developments on graded quiver with potentials, higher Ginzburg algebras and higher cluster categories (also known as $m$-cluster categories). Quiver mutations studied in the context of mathematics precisely correspond to the order $(m+1)$ dualities of the gauge theories. Our work suggests that these equivalences of quiver gauge theories sit inside an infinite family of such generalized dualities, whose physical interpretation is yet to be understood.Comment: 61 pages, 30 figure

Design of tch-type sequences for communications

This thesis deals with the design of a class of cyclic codes inspired by TCH codewords. Since TCH codes are linked to finite fields the fundamental concepts and facts about abstract algebra, namely group theory and number theory, constitute the first part of the thesis. By exploring group geometric properties and identifying an equivalence between some operations on codes and the symmetries of the dihedral group we were able to simplify the generation of codewords thus saving on the necessary number of computations. Moreover, we also presented an algebraic method to obtain binary generalized TCH codewords of length N = 2k, k = 1,2, . . . , 16. By exploring Zech logarithm’s properties as well as a group theoretic isomorphism we developed a method that is both faster and less complex than what was proposed before. In addition, it is valid for all relevant cases relating the codeword length N and not only those resulting from N = p

The Discrete Logarithm Problem in Finite Fields of Small Characteristic

Computing discrete logarithms is a long-standing algorithmic problem, whose hardness forms the basis for numerous current public-key cryptosystems. In the case of finite fields of small characteristic, however, there has been tremendous progress recently, by which the complexity of the discrete logarithm problem (DLP) is considerably reduced. This habilitation thesis on the DLP in such fields deals with two principal aspects. On one hand, we develop and investigate novel efficient algorithms for computing discrete logarithms, where the complexity analysis relies on heuristic assumptions. In particular, we show that logarithms of factor base elements can be computed in polynomial time, and we discuss practical impacts of the new methods on the security of pairing-based cryptosystems. While a heuristic running time analysis of algorithms is common practice for concrete security estimations, this approach is insufficient from a mathematical perspective. Therefore, on the other hand, we focus on provable complexity results, for which we modify the algorithms so that any heuristics are avoided and a rigorous analysis becomes possible. We prove that for any prime field there exist infinitely many extension fields in which the DLP can be solved in quasi-polynomial time. Despite the two aspects looking rather independent from each other, it turns out, as illustrated in this thesis, that progress regarding practical algorithms and record computations can lead to advances on the theoretical running time analysis -- and the other way around.Die Berechnung von diskreten Logarithmen ist ein eingehend untersuchtes algorithmisches Problem, dessen Schwierigkeit zahlreiche Anwendungen in der heutigen Public-Key-Kryptographie besitzt. Für endliche Körper kleiner Charakteristik sind jedoch kürzlich erhebliche Fortschritte erzielt worden, welche die Komplexität des diskreten Logarithmusproblems (DLP) in diesem Szenario drastisch reduzieren. Diese Habilitationsschrift erörtert zwei grundsätzliche Aspekte beim DLP in Körpern kleiner Charakteristik. Es werden einerseits neuartige, erheblich effizientere Algorithmen zur Berechnung von diskreten Logarithmen entwickelt und untersucht, wobei die Laufzeitanalyse auf heuristischen Annahmen beruht. Unter anderem wird gezeigt, dass Logarithmen von Elementen der Faktorbasis in polynomieller Zeit berechnet werden können, und welche praktischen Auswirkungen die neuen Verfahren auf die Sicherheit paarungsbasierter Kryptosysteme haben. Während heuristische Laufzeitabschätzungen von Algorithmen für die konkrete Sicherheitsanalyse üblich sind, so erscheint diese Vorgehensweise aus mathematischer Sicht unzulänglich. Der Aspekt der beweisbaren Komplexität für DLP-Algorithmen konzentriert sich deshalb darauf, modifizierte Algorithmen zu entwickeln, die jegliche heuristische Annahme vermeiden und dessen Laufzeit rigoros gezeigt werden kann. Es wird bewiesen, dass für jeden Primkörper unendlich viele Erweiterungskörper existieren, für die das DLP in quasi-polynomieller Zeit gelöst werden kann. Obwohl die beiden Aspekte weitgehend unabhängig voneinander erscheinen mögen, so zeigt sich, wie in dieser Schrift illustriert wird, dass Fortschritte bei praktischen Algorithmen und Rekordberechnungen auch zu Fortentwicklungen bei theoretischen Laufzeitabschätzungen führen -- und umgekehrt