Computing discrete logarithms in real quadratic congruence function fields of large genus
Open Access
- 1 April 1999
- journal article
- research article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 68 (226) , 807-823
- https://doi.org/10.1090/s0025-5718-99-01040-6
Abstract
The discrete logarithm problem in various finite abelian groups is the basis for some well known public key cryptosystems. Recently, real quadratic congruence function fields were used to construct a public key distribution system. The security of this public key system is based on the difficulty of a discrete logarithm problem in these fields. In this paper, we present a probabilistic algorithm with subexponential running time that computes such discrete logarithms in real quadratic congruence function fields of sufficiently large genus. This algorithm is a generalization of similar algorithms for real quadratic number fields.Keywords
This publication has 8 references indexed in Scilit:
- Key-exchange in real quadratic congruence function fieldsDesigns, Codes and Cryptography, 1996
- Short Representation of Quadratic IntegersPublished by Springer Nature ,1995
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- A Course in Computational Algebraic Number TheoryPublished by Springer Nature ,1993
- Explicit Bounds for Primality Testing and Related ProblemsMathematics of Computation, 1990
- Hermite Normal Form Computation Using Modulo Determinant ArithmeticMathematics of Operations Research, 1987
- Sur les courbes algébriques et les variétés qui s’en déduisent (Introduction)Published by Springer Nature ,1979
- Lectures on the Theory of Algebraic Functions of One VariableLecture Notes in Mathematics, 1973