Cryptography in quadratic function fields (Q5931254): Difference between revisions

The paper considers the discrete logarithm problem in quadratic function fields of odd characteristic. In the imaginary representation of such a field, this is the discrete logarithm problem in the ideal class group of the field, or equivalently, in the Jacobian of the curve defining the function field. In the real case, the problem in question is the task of computing distances in the set of reduced principal ideals, which is a monoid under a suitable operation. Currently, the best general algorithms for solving both discrete logarithm problems are exponential (sub-exponential only in fields of high genus), resulting in a possibly higher level of security than that of conventional discrete logarithm based schemes. The paper also provides the algorithms necessary to use these fields for cryptography. Finally, the paper describes how these algorithms can be used to do Diffie-Hellman key-exchange and ElGamal-like signature and encryption schemes in these fields.