Remarks on the self-shrinking Clifford torus

On the one hand, we prove that the Clifford torus in $\mathbb{C}^2$ is unstable for Lagrangian mean curvature flow under arbitrarily small Hamiltonian perturbations, even though it is Hamiltonian $F$-stable and locally area minimising under Hamiltonian variations. On the other hand, we show that the Clifford torus is rigid: it is locally unique as a self-shrinker for mean curvature flow, despite having infinitesimal deformations which do not arise from rigid motions. The proofs rely on analysing higher order phenomena: specifically, showing that the Clifford torus is not a local entropy minimiser even under Hamiltonian variations, and demonstrating that infinitesimal deformations which do not generate rigid motions are genuinely obstructed.Comment: 31 pages, v3: additional details for proof of local uniqueness of the Clifford torus as a self-shrinker provide

Hidden Symmetries of the Principal Chiral Model Unveiled

By relating the two-dimensional U(N) Principal Chiral Model to a simple linear system we obtain a free-field parametrisation of solutions. Obvious symmetry transformations on the free-field data give symmetries of the model. In this way all known `hidden symmetries' and B\"acklund transformations, as well as a host of new symmetries, arise.Comment: 21 pages, Latex. A sentence and citation adde

Cryptanalysis of LFSR-based Pseudorandom Generators - a Survey

Pseudorandom generators based on linear feedback shift registers (LFSR) are a traditional building block for cryptographic stream ciphers. In this report, we review the general idea for such generators, as well as the most important techniques of cryptanalysis

An Improved Linear Feedback Shift Register (LFSR- based) Stream Cipher Generator

Linear feedback shift register ( LFSR-based) stream cipher an improved design for a random key generator in a stream cipher algorithm. The proposed random key generator is simply designed to produce a very quick algorithm to be used for securing GSM communication as mobiles or in satellite communications channels, and it use to avoid attack that happen on cryptography in general and on stream cipher in specific. The simplicity of the design derived from using of four small LFSR and three Xored gates and a single (3 to 1) multiplexer on the content of 8-stages LFSR

A cotangent fibre generates the Fukaya category

We prove that the algebra of chains on the based loop space recovers the derived (wrapped) Fukaya category of the cotangent bundle of a closed smooth orientable manifold. The main new idea is the proof that a cotangent fibre generates the Fukaya category using a version of the map from symplectic cohomology to the homology of the free loop space introduced by Cieliebak and Latschev.Comment: 40 pages, 10 figures. Minor changes. Final version to appear in Advances in Mathematic

On Cryptographic Properties of LFSR-based Pseudorandom Generators

Pseudorandom Generators (PRGs) werden in der modernen Kryptographie verwendet, um einen kleinen Startwert in eine lange Folge scheinbar zufälliger Bits umzuwandeln. Viele Designs für PRGs basieren auf linear feedback shift registers (LFSRs), die so gewählt sind, dass sie optimale statistische und periodische Eigenschaften besitzen. Diese Arbeit diskutiert Konstruktionsprinzipien und kryptanalytische Angriffe gegen LFSR-basierte PRGs. Nachdem wir einen vollständigen Überblick über existierende kryptanalytische Ergebnisse gegeben haben, führen wir den dynamic linear consistency test (DLCT) ein und analysieren ihn. Der DLCT ist eine suchbaum-basierte Methode, die den inneren Zustand eines PRGs rekonstruiert. Wir beschließen die Arbeit mit der Diskussion der erforderlichen Zustandsgröße für PRGs, geben untere Schranken an und Beispiele aus der Praxis, die veranschaulichen, welche Größe sichere PRGs haben müssen