Investigations in the design and analysis of key-stream generators

iv+113hlm.;24c

On the factorization of polynomials over algebraic fields

SIGLEAvailable from British Library Document Supply Centre- DSC:DX86869 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

The Infrared Behavior of QCD Green's Functions - Confinement, Dynamical Symmetry Breaking, and Hadrons as Relativistic Bound States

Recent studies of QCD Green's functions and their applications in hadronic physics are reviewed. We briefly discuss the issues of gauge fixing, BRS invariance and positivity. Evidence for the violation of positivity by quarks and transverse gluons in the covariant gauge is collected, and it is argued that this is one manifestation of confinement. We summarise the derivation of the Dyson-Schwinger equations (DSEs) of QED and QCD. The influence of instantons on DSEs in a 2-dimensional model is mentioned. Solutions for the Green's functions in QED in 2+1 and 3+1 dimensions provide tests of various schemes to truncate DSEs. We discuss possible extensions to QCD and their limitations. Truncation schemes for DSEs of QCD are discussed in the axial gauge and in the Landau gauge. We review the available results from a systematic non-perturbative expansion scheme established for Landau gauge QCD. Comparisons to related lattice results, where available, are presented. The applications of QCD Green's functions to hadron physics are summarized. Properties of ground state mesons are discussed on the basis of the Bethe-Salpeter equation for quarks and antiquarks. The Goldstone nature of pseudoscalar mesons and mechanisms of diquark confinement are reviewed. We discuss some properties of ground state baryons based on their description as Bethe-Salpeter/Faddeev bound states of quark-diquark correlations in the quantum field theory of confined quarks and gluons.Comment: 212 Pages, LaTeX2e, submitted to Physics Reports; typos corrected, improvements on grammar and style, references adde

Six lectures on Geometric Quantization

These are the lecture notes for a short course on geometric quantization given by the author at the XVIII Modave Summer School on Mathematical Physics, Sep 5 - Sep 9

Eisenstein series and automorphic representations

We provide an introduction to the theory of Eisenstein series and automorphic forms on real simple Lie groups G, emphasising the role of representation theory. It is useful to take a slightly wider view and define all objects over the (rational) adeles A, thereby also paving the way for connections to number theory, representation theory and the Langlands program. Most of the results we present are already scattered throughout the mathematics literature but our exposition collects them together and is driven by examples. Many interesting aspects of these functions are hidden in their Fourier coefficients with respect to unipotent subgroups and a large part of our focus is to explain and derive general theorems on these Fourier expansions. Specifically, we give complete proofs of the Langlands constant term formula for Eisenstein series on adelic groups G(A) as well as the Casselman--Shalika formula for the p-adic spherical Whittaker function associated to unramified automorphic representations of G(Q_p). In addition, we explain how the classical theory of Hecke operators fits into the modern theory of automorphic representations of adelic groups, thereby providing a connection with some key elements in the Langlands program, such as the Langlands dual group LG and automorphic L-functions. Somewhat surprisingly, all these results have natural interpretations as encoding physical effects in string theory. We therefore also introduce some basic concepts of string theory, aimed toward mathematicians, emphasising the role of automorphic forms. In particular, we provide a detailed treatment of supersymmetry constraints on string amplitudes which enforce differential equations of the same type that are satisfied by automorphic forms. Our treatise concludes with a detailed list of interesting open questions and pointers to additional topics which go beyond the scope of this book.Comment: 326 pages. Detailed and example-driven exposition of the subject with highlighted applications to string theory. v2: 375 pages. Substantially extended and small correction

Eisenstein series and automorphic representations

We provide an introduction to the theory of Eisenstein series and automorphic forms on real simple Lie groups G, emphasising the role of representation theory. It is useful to take a slightly wider view and define all objects over the (rational) adeles A, thereby also paving the way for connections to number theory, representation theory and the Langlands program. Most of the results we present are already scattered throughout the mathematics literature but our exposition collects them together and is driven by examples. Many interesting aspects of these functions are hidden in their Fourier coefficients with respect to unipotent subgroups and a large part of our focus is to explain and derive general theorems on these Fourier expansions. Specifically, we give complete proofs of Langlands' constant term formula for Eisenstein series on adelic groups G(A) as well as the Casselman--Shalika formula for the p-adic spherical Whittaker vector associated to unramified automorphic representations of G(Q_p). Somewhat surprisingly, all these results have natural interpretations as encoding physical effects in string theory. We therefore introduce also some basic concepts of string theory, aimed toward mathematicians, emphasising the role of automorphic forms. In addition, we explain how the classical theory of Hecke operators fits into the modern theory of automorphic representations of adelic groups, thereby providing a connection with some key elements in the Langlands program, such as the Langlands dual group LG and automorphic L-functions. Our treatise concludes with a detailed list of interesting open questions and pointers to additional topics where automorphic forms occur in string theory

Design and Analysis of Cryptographic Algorithms for Authentication

During the previous decades, the upcoming demand for security in the digital world, e.g., the Internet, lead to numerous groundbreaking research topics in the field of cryptography. This thesis focuses on the design and analysis of cryptographic primitives and schemes to be used for authentication of data and communication endpoints, i.e., users. It is structured into three parts, where we present the first freely scalable multi-block-length block-cipher-based compression function (Counter-bDM) in the first part. The presented design is accompanied by a thorough security analysis regarding its preimage and collision security. The second and major part is devoted to password hashing. It is motivated by the large amount of leaked password during the last years and our discovery of side-channel attacks on scrypt – the first modern password scrambler that allowed to parameterize the amount of memory required to compute a password hash. After summarizing which properties we expect from a modern password scrambler, we (1) describe a cache-timing attack on scrypt based on its password-dependent memory-access pattern and (2) outline an additional attack vector – garbage-collector attacks – that exploits optimization which may disregard to overwrite the internally used memory. Based on our observations, we introduce Catena – the first memory-demanding password-scrambling framework that allows a password-independent memory-access pattern for resistance to the aforementioned attacks. Catena was submitted to the Password Hashing Competition (PHC) and, after two years of rigorous analysis, ended up as a finalist gaining special recognition for its agile framework approach and side-channel resistance. We provide six instances of Catena suitable for a variety of applications. We close the second part of this thesis with an overview of modern password scramblers regarding their functional, security, and general properties; supported by a brief analysis of their resistance to garbage-collector attacks. The third part of this thesis is dedicated to the integrity (authenticity of data) of nonce-based authenticated encryption schemes (NAE). We introduce the so-called j-IV-Collision Attack, allowing to obtain an upper bound for an adversary that is provided with a first successful forgery and tries to efficiently compute j additional forgeries for a particular NAE scheme (in short: reforgeability). Additionally, we introduce the corresponding security notion j-INT-CTXT and provide a comparative analysis (regarding j-INT-CTXT security) of the third-round submission to the CAESAR competition and the four classical and widely used NAE schemes CWC, CCM, EAX, and GCM.Die fortschreitende Digitalisierung in den letzten Jahrzehnten hat dazu geführt, dass sich das Forschungsfeld der Kryptographie bedeutsam weiterentwickelt hat. Diese, im Wesentlichen aus drei Teilen bestehende Dissertation, widmet sich dem Design und der Analyse von kryptographischen Primitiven und Modi zur Authentifizierung von Daten und Kommunikationspartnern. Der erste Teil beschäftigt sich dabei mit blockchiffrenbasierten Kompressionsfunktionen, die in ressourcenbeschränkten Anwendungsbereichen eine wichtige Rolle spielen. Im Rahmen dieser Arbeit präsentieren wir die erste frei skalierbare und sichere blockchiffrenbasierte Kompressionsfunktion Counter-bDM und erweitern somit flexibel die erreichbare Sicherheit solcher Konstruktionen. Der zweite Teil und wichtigste Teil dieser Dissertation widmet sich Passwort-Hashing-Verfahren. Zum einen ist dieser motiviert durch die große Anzahl von Angriffen auf Passwortdatenbanken großer Internet-Unternehmen. Zum anderen bot die Password Hashing Competition (PHC) die Möglichkeit, unter Aufmerksamkeit der Expertengemeinschaft die Sicherheit bestehender Verfahren zu hinterfragen, sowie neue sichere Verfahren zu entwerfen. Im Rahmen des zweiten Teils entwarfen wir Anforderungen an moderne Passwort-Hashing-Verfahren und beschreiben drei Arten von Seitenkanal-Angriffen (Cache-Timing-, Weak Garbage-Collector- und Garbage-Collector-Angriffe) auf scrypt – das erste moderne Password-Hashing-Verfahren welches erlaubte, den benötigten Speicheraufwand zur Berechnung eines Passworthashes frei zu wählen. Basierend auf unseren Beobachtungen und Angriffen, stellen wir das erste moderne PasswordHashing-Framework Catena vor, welches für gewählte Instanzen passwortunabhängige Speicherzugriffe und somit Sicherheit gegen oben genannte Angriffe garantiert. Catena erlangte im Rahmen des PHC-Wettbewerbs besondere Anerkennung für seine Agilität und Resistenz gegen SeitenkanalAngriffe. Wir präsentieren sechs Instanzen des Frameworks, welche für eine Vielzahl von Anwendungen geeignet sind. Abgerundet wird der zweite Teil dieser Arbeit mit einem vergleichenden Überblick von modernen Passwort-Hashing-Verfahren hinsichtlich ihrer funktionalen, sicherheitstechnischen und allgemeinen Eigenschaften. Dieser Vergleich wird unterstützt durch eine kurze Analyse bezüglich ihrer Resistenz gegen (Weak) Garbage-Collector-Angriffe. Der dritte teil dieser Arbeit widmet sich der Integrität von Daten, genauer, der Sicherheit sogenannter Nonce-basierten authentisierten Verschlüsselungsverfahren (NAE-Verfahren), welche ebenso wie Passwort-Hashing-Verfahren in der heutigen Sicherheitsinfrastruktur des Internets eine wichtige Rolle spielen. Während Standard-Definitionen keine Sicherheit nach dem Fund einer ersten erfolgreich gefälschten Nachricht betrachten, erweitern wir die Sicherheitsanforderungen dahingehend wie schwer es ist, weitere Fälschungen zu ermitteln. Wir abstrahieren die Funktionsweise von NAEVerfahren in Klassen, analysieren diese systematisch und klassifizieren die Dritt-Runden-Kandidaten des CAESAR-Wettbewerbs, sowie vier weit verbreitete NAE-Verfahren CWC, CCM, EAX und GCM