Thesis (Ph. D.)--University of Wisconsin--Madison, 1984. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 75-76).

If b is an inner function and T is the unit circle, then composition with b induces an endomorphism, β, of L1(T) that leaves H1(T) invariant. In this document we investigate the structure of the endomorphisms of B(L2(T)) and B(H2(T)) that implement by studying the representations of L1(T) and H1(T) in terms of multiplication operators on B(L2(T)) and B(H2(T)). Our analysis, which was inspired by the work of R. Rochberg and J. McDonald, will range from the theory of composition operators on spaces of analytic functions to recent work on Cuntz families of isometries and Hilbert C*-modules.

Thesis (MSc)--University of Stellenbosch, 2005. / Bibliography. Also available via the Internet.

We provide an explicit algorithm for computing the trace of an endomorphism of an elliptic curve which is given by a chain of small-degree isogenies. We analyze its complexity, determining that if the length of the chain, the degree of the isogenies, and the log of the field-size are all O(n), the trace of the endomorphism can be computed in O(n⁶) bit operations. This makes explicit a theorem of Kohel which states that such a polynomial time algorithm exists. The given procedure is based on Schoof's point-counting algorithm. / Master of Science / The developing technology of quantum computers threatens to render current cryptographic systems (that is, systems for protecting stored or transmitted digital information from unauthorized third parties) ineffective. Among the systems proposed to ensure information security against attacks by quantum computers is a cryptographic scheme known as SIKE. In this thesis, we provide and analyze an algorithm that comprises one piece of a potential attack against SIKE by a classical computer. The given algorithm is also useful more generally in the field of arithmetic geometry.

La cryptographie est indispensable aux réseaux de communication modernes afin de garantir la sécurité et l'intégrité des données y transitant. Récemment, des cryptosystèmes efficaces, sûr et riches ont été construits à partir de variétés abéliennes définies sur des corps finis. Cette thèse contribue à plusieurs aspects algorithmiques de ces variétés touchant à leurs anneaux d'endomorphismes. Cette structure joue un rôle capital pour construire des variétés abéliennesmunies de bonnes propriétés, comme des couplages, et nous montrons qu'un plus grand nombre de telles variétés peut être construit qu'on ne pourrait croire. Nous considérons aussi le problème inverse qu'est celui du calcul de l'anneau d'endomorphismes d'une variété abélienne donnée. Les meilleures méthodes connues ne pouvaient précédemment résoudre ce problème qu'en temps exponentiel ; ici, nous concevons plusieurs algorithmes de complexité sous-exponentielle le résolvant dans le cas ordinaire. Pour les courbes elliptiques, nous bornons rigoureusement la complexité de nos algorithmes sous l'hypothèse de Riemann étendue et démontrons qu'ils sont extrêmement efficaces en pratique. Comme sous-routine, nous développons notamment un algorithme sans mémoire pour résoudre une généralisation du problème du sac à dos. Nous généralisons aussi notre méthode aux variétés abélienne de dimension supérieure. Concrètement, nous développons une bibliothèque qui permet d'évaluer des isogénies entre variétés abéliennes ; cet outil nous permet d'appliquer une généralisation de notre méthode à des exemples jusqu'alors incalculables. / Modern communications heavily rely on cryptography to ensure data integrity and privacy. Over the past two decades, very efficient, secure, and featureful cryptographic schemes have been built on top of abelian varieties defined overfinite fields. This thesis contributes to several computational aspects of ordinary abelian varieties related to their endomorphism ring structure. This structure plays a crucial role in the construction of abelian varieties with desirable properties, such as pairings, and we show that more such varieties can be constructed than expected. We also address the inverse problem, that of computing the endomorphism ring of a prescribed abelian variety. Prior state-of-the-art methods could only solve this problem in exponential time, and we design several algorithms of subexponential complexityfor solving it in the ordinary case. For elliptic curves, we rigorously bound the complexity of our algorithms assuming solely the extended Riemann hypothesis, and demonstrate that they are very effective in practice. As a subroutine, we design in particular a memory-less algorithm to solve a generalization of the subset sum problem. We also generalize our method to higher-dimensional abelian varieties. Practically speaking, we develop a library enabling the computation of isogenies between abelian varieties; this building block enables us to apply a generalization of our algorithm to cases that were previously not computable.

by Lok Tsan-ming. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1994. / Includes bibliographical references (leaves 74-75). / Introduction --- p.2 / Chapter 1 --- "Rings, Modules and Categories" --- p.4 / Chapter 1.1 --- "Rings, Subrings and Ideals" --- p.5 / Chapter 1.2 --- Modules and Categories --- p.8 / Chapter 1.3 --- Module Theory --- p.13 / Chapter 2 --- Isomorphisms between Endomorphism rings of Quasiprogener- ators --- p.24 / Chapter 2.1 --- Preliminaries --- p.24 / Chapter 2.2 --- The Fundamental Theorem --- p.31 / Chapter 2.3 --- Isomorphisms Induced by Semilinear Maps --- p.41 / Chapter 2.4 --- Isomorphisms of General linear groups --- p.46 / Chapter 3 --- Endomorphism ring of projective module --- p.54 / Chapter 3.1 --- Preliminaries --- p.54 / Chapter 3.2 --- Main Theorem --- p.60 / Bibliography --- p.74

Thesis (MSc (Mathematics))--University of Stellenbosch, 2005. / The aim of this thesis is to study the unital subrings contained in associative algebras arising as the endomorphism algebras of hyperelliptic Jacobians over finite fields. In the first part we study associative algebras with special emphasis on maximal orders. In the second part we introduce the theory of abelian varieties over finite fields and study the ideal structures of their endomorphism rings. Finally we specialize to hyperelliptic Jacobians and study their endomorphism rings.

Let Ω be the Fraïssé limit of a class of relational structures. We seek to answer the following semigroup theoretic question about Ω. What are the group H-classes, i.e. the maximal subgroups, of End(Ω)? Fraïssé limits for which we answer this question include the random graph R, the random directed graph D, the random tournament T, the random bipartite graph B, Henson's graphs G[subscript n] (for n greater or equal to 3) and the total order Q. The maximal subgroups of End(Ω) are closely connected to the automorphism groups of the relational structures induced by the images of idempotents from End(Ω). It has been shown that the relational structure induced by the image of an idempotent from End(Ω) is algebraically closed. Accordingly, we investigate which groups can be realised as the automorphism group of an algebraically closed relational structure in order to determine the maximal subgroups of End(Ω) in each case. In particular, we show that if Γ is a countable graph and Ω = R,D,B, then there exist 2[superscript aleph-naught] maximal subgroups of End(Ω) which are isomorphic to Aut(Γ). Additionally, we provide a complete description of the subsets of Q which are the image of an idempotent from End(Q). We call these subsets retracts of Q and show that if Ω is a total order and f is an embedding of Ω into Q such that im f is a retract of Q, then there exist 2[superscript aleph-naught] maximal subgroups of End(Q) isomorphic to Aut(Ω). We also show that any countable maximal subgroup of End(Q) must be isomorphic to Zⁿ for some natural number n. As a consequence of the methods developed, we are also able to show that when Ω = R,D,B,Q there exist 2[superscript aleph-naught] regular D-classes of End(Ω) and when Ω = R,D,B there exist 2[superscript aleph-naught] J-classes of End(Ω). Additionally we show that if Ω = R,D then all regular D-classes contain 2[superscript aleph-naught] group H-classes. On the other hand, we show that when Ω = B,Q there exist regular D-classes which contain countably many group H-classes.

Seja K um conjunto de Cantor. Neste trabalho apresentamos dois teoremas relacionados a densidade do conjunto das dinâmicas simbólicas. No caso de endomorfismos provamos que, dado uma dinâmica T : K K, existe uma T : K K próxima a T, tal que toda órbita é finalmente periódica. Já no caso de homeomorfismos, mostramos que, dado uma dinâmica T : K K, existe uma T : K K próxima a T, tal que o w-limite de toda órbita de T é uma órbita periódica. Em particular, mostramos que, em ambos os casos, todas as medidas ergódicas estão suportadas em órbitas periódicas. / Let K be a Cantor set. In this work we present two theorems related to the density of symbolic dynamics. We prove that given an endomorphism T : K K then there exists an endomorphism ~ T : K K close to T such that every orbit is finally periodic. We also prove that given a homeomorphism T : K K then there exists a homeomorphism ~ T : K K close to T such that the w-limit of every orbit is a periodic orbit. In particular, we have shown, in both cases, that all ergodic measures have support on periodic orbits.

Seja K um conjunto de Cantor. Neste trabalho apresentamos dois teoremas relacionados a densidade do conjunto das dinâmicas simbólicas. No caso de endomorfismos provamos que, dado uma dinâmica T : K K, existe uma T : K K próxima a T, tal que toda órbita é finalmente periódica. Já no caso de homeomorfismos, mostramos que, dado uma dinâmica T : K K, existe uma T : K K próxima a T, tal que o w-limite de toda órbita de T é uma órbita periódica. Em particular, mostramos que, em ambos os casos, todas as medidas ergódicas estão suportadas em órbitas periódicas. / Let K be a Cantor set. In this work we present two theorems related to the density of symbolic dynamics. We prove that given an endomorphism T : K K then there exists an endomorphism ~ T : K K close to T such that every orbit is finally periodic. We also prove that given a homeomorphism T : K K then there exists a homeomorphism ~ T : K K close to T such that the w-limit of every orbit is a periodic orbit. In particular, we have shown, in both cases, that all ergodic measures have support on periodic orbits.