32 citations · 40 across the 13 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CC2013★ 1 cited
On the relation generation method of Joux for computing discrete logarithms
Ming-Deh Huang, Anand Kumar Narayanan
In \cite{joux}, Joux devised an algorithm to compute discrete logarithms between elements in a certain subset of the multiplicative group of an extension of the finite field $\math…
math.NT2013
Computing Class Groups of Function Fields Using Stark Units
Ming-Deh Huang, Anand Kumar Narayanan
Let be a fixed finite geometric extension of the rational function field . Let be a finite abelian extension such that there is an $\Fq$-rational place $…
cs.DM2013
Finding Primitive Elements in Finite Fields of Small Characteristic
Ming-Deh Huang, Anand Kumar Narayanan
We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field where is a prime. In time polynomial i…