KLUEDO RSS FeedKLUEDO Dokumente/documents
https://kluedo.ub.uni-kl.de/index/index/
Wed, 11 Feb 2004 16:00:23 +0100Wed, 11 Feb 2004 16:00:23 +0100Construction of algebraic correspondences between hyperelliptic function fields using Deuring`s theory
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1515
In this thesis we show that the theory of algebraic correspondences introduced by Deuring in the 1930s can be applied to construct non-trivial homomorphisms between the Jacobi groups of hyperelliptic function fields. Concretely, we deduce algorithms to add and multiply correspondences which perform in a reasonable time if the degrees of the associated divisors of the double field are small. Moreover, we show how to compute the differential matrices associated to prime divisors of the double field for arbitrary genus. These matrices give a representation for the homomorphisms or endomorphisms in the additive group (ring) of matrices which is even faithful if the ground field has characteristic zero. As first examples for non-trivial correspondences we investigate multiplication by m endomorphisms. Afterwards we use factorisations of certain bivariate polynomials to construct prime divisors of the double field that are not equivalent to 0 in a coarser sense. Applying the theory of Deuring, these divisors yield homomorphisms between the Jacobi groups of special classes of hyperelliptic function fields. Finally, we generalise the Richelot isogeny to higher genus and by this way derive a class of hyperelliptic function fields given in terms of their defining polynomials which admit non-trivial homomorphisms. These include homomorphisms between the Jacobi groups of hyperelliptic curves of different as well as of equal genus. In addition we provide an explicit method to construct genus 2 function fields the endomorphism ring of which contains a sqrt(2) multiplication with the help of the Cholesky decomposition of a certain matrix.Georg Kuxdoctoralthesishttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1515Wed, 11 Feb 2004 16:00:23 +0100Kryptanalyse der Verschlüsselungsalgorithmen der Microsoft Word Versionen 2.0-7.0
https://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1258
Roland Fiat; Andreas Guthmann; Georg Kuxpreprinthttps://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/1258Thu, 31 May 2001 00:00:00 +0200