Reference : Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/12940
Computing Discrete Logarithms in Real Quadratic Congruence Function Fields of Large Genus
English
Müller, Volker mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Stein, Andreas [> >]
Thiel, Christoph [> >]
1999
Mathematics of Computation
AMS
68
226
807-822
Yes (verified by ORBilu)
0025-5718
[en] 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.
http://hdl.handle.net/10993/12940

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.