- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from

**public sources and our publisher partners.**We describe a new class of list decodable codes based on Galois extensions of function fields and present a list decoding algorithm. These codes are obtained as a result of folding the set of… Expand

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the… Expand

In 1864, Waage and Guldberg formulated the “law of mass action.” Since that time, chemists, chemical engineers, physicists and mathematicians have amassed a great deal of knowledge on the topic. In… Expand

Recent years have seen a large number of game-based training systems or serious games developed for diversified learning domains. Despite the hypothesis that computer games are motivator to promote… Expand

We consider computational problems concerning algebras over finite fields. In particular, we propose an algorithm for finding a small generating set for the multiplicative group of GF(p)[x]/F, where… Expand

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 $\mathbb{F}_{p^n}$ in… Expand

We study the discrete logarithm problem for the multiplicative group and for elliptic curves over a finite field by using a lifting of the corresponding object to an algebraic number field and global… Expand

[] Proceedings 32nd Annual Symposium of…

Several computational problems concerning the construction of rational functions and intersecting curves over a given curve are studied. The first problem is to construct a rational function with… Expand

This is the third in a series of papers in which we develop a unified method for treating the discrete logarithm problem (DLP) in various contexts. In [HR1], we described a formalism using global… Expand

Let A be a finite abelian group and x an element of A. Let y be in the subgroup generated by x, so that y = nx for some positive integer n. Recall that the discrete logarithm problem is to determine… Expand