• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • Tagged with
  • 5
  • 5
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Endomorphism rings and elementary divisor theory for modules over Dedekind-like rings

Byun, Hyeja. January 1984 (has links)
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).
2

Endomorphism rings of hyperelliptic Jacobians /

Kriel, Marelize. January 2005 (has links)
Thesis (MSc)--University of Stellenbosch, 2005. / Bibliography. Also available via the Internet.
3

Computing the trace of an endomorphism of a supersingular elliptic curve

Wills, Michael Thomas 10 June 2021 (has links)
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.
4

Morita equivalence and isomorphisms between general linear groups.

January 1994 (has links)
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
5

Endomorphism rings of hyperelliptic Jacobians

Kriel, Marelize 03 1900 (has links)
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.

Page generated in 0.0645 seconds