Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus

We present a sub-exponential algorithm for computing discrete loga­rithms 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 gene­ralization of a similar algorithm for quadratic number fields.