[en] We present a sub-exponential algorithm for computing discrete logarithms in real quadratic congruence function fields of sufficiently large genus. We prove the correctness and the expected running time of the algorithm. The algorithm is a generalization of a similar algorithm for quadratic number fields.
Disciplines :
Sciences informatiques
Identifiants :
UNILU:UL-ARTICLE-2009-403
Auteur, co-auteur :
Müller, Volker ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Stein, Andreas
Thiel, Christoph
Langue du document :
Anglais
Titre :
Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus
