Computing discrete logarithms in subfields of residue class rings

MaRDI QIDQ6249360zbMATH OpenFDO

Authors Ming-Deh A. Huang, Anand Kumar Narayanan

Publication date 26 February 2014

Abstract: Recent breakthrough methods cite{gggz,joux,bgjt} on computing discrete logarithms in small characteristic finite fields share an interesting feature in common with the earlier medium prime function field sieve method cite{jl}. To solve discrete logarithms in a finite extension of a finite field $F$, a polynomial $h(x)inF[x]$ of a special form is constructed with an irreducible factor $g(x)inF[x]$ of the desired degree. The special form of $h(x)$ is then exploited in generating multiplicative relations that hold in the residue class ring $F[x]/h(x)F[x]$ hence also in the target residue class field $F[x]/g(x)F[x]$. An interesting question in this context and addressed in this paper is: when and how does a set of relations on the residue class ring determine the discrete logarithms in the finite fields contained in it? We give necessary and sufficient conditions for a set of relations on the residue class ring to determine discrete logarithms in the finite fields contained in it. We also present efficient algorithms to derive discrete logarithms from the relations when the conditions are met. The derived necessary conditions allow us to clearly identify structural obstructions intrinsic to the special polynomial $h(x)$ in each of the aforementioned methods, and propose modifications to the selection of $h(x)$ so as to avoid obstructions.

This page was built for publication: Computing discrete logarithms in subfields of residue class rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6249360)