On a Simple Primality Testing Algorithm. - Ming-Deh A. Huang (EUROSAM, 1984)

Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields - Ming-Deh A. Huang (STOC, 1984)

Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Networks - Ming-Deh A. Huang (FOCS, 1985)

Riemann Hypothesis and Finding Roots over Finite Fields - Ming-Deh A. Huang (STOC, 1985)

Implications of Forbidden Structures for Extremal Algorithmic Problems. - Ming-Deh A. Huang; Karl J. Lieberherr (Theor. Comput. Sci., 1985)

Recognizing Primes in Random Polynomial Time - Leonard M. Adleman; Ming-Deh A. Huang (STOC, 1987)

Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks. - Alok Aggarwal; Ming-Deh A. Huang (AWOC, 1988)

A Universal Problem in Secure and Verifiable Distributed Computation. - Ming-Deh A. Huang; Shang-Hua Teng (CRYPTO, 1988)

Secure and Verifiable Schemes for Election and General Distributed Computing Problems. - Ming-Deh A. Huang; Shang-Hua Teng (PODC, 1988)

Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum Depth - Gwoboa Horng; Ming-Deh A. Huang (FOCS, 1990)

Security, Verifiability, and Universality in Distributed Computing. - Ming-Deh A. Huang; Shang-Hua Teng (J. Algorithms, 1990)

Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve (Extended Abstract) - Ming-Deh A. Huang; Doug Ierardi (FOCS, 1991)

Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields. - Ming-Deh A. Huang (J. Algorithms, 1991)

Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields. - Ming-Deh A. Huang (J. Algorithms, 1991)

Counting Rational Points on Curves over Finite Fields (Extended Abstract) - Ming-Deh A. Huang; Doug Ierardi (FOCS, 1993)

A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. - Leonard M. Adleman; Jonathan DeMarrais; Ming-Deh A. Huang (ANTS, 1994)

Efficient checking of computations in number theory. - Leonard M. Adleman; Ming-Deh A. Huang; Kireeti Kompella (ANTS, 1994)

Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve. - Ming-Deh A. Huang; Doug Ierardi (J. Symb. Comput., 1994)

Efficient Checkers for Number-Theoretic Computations - Leonard M. Adleman; Ming-Deh A. Huang; Kireeti Kompella (Inf. Comput., 1995)

Counting Rational Points on Curves and Abelian Varieties over Finite Fields. - Leonard M. Adleman; Ming-Deh A. Huang (ANTS, 1996)

Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract). - Ming-Deh A. Huang; Yiu-Chung Wong (FOCS, 1996)

Quantum Computability. - Leonard M. Adleman; Jonathan DeMarrais; Ming-Deh A. Huang (SIAM J. Comput., 1997)

An Algorithm for Approximate Counting of Points on Algebraic Sets over Finite Fields. - Ming-Deh A. Huang; Yiu-Chung Wong (ANTS, 1998)

A Black Box Approach to the Algebraic Set Decomposition Problem. - Ming-Deh A. Huang; Ashwin J. Rao (STOC, 1998)

Counting Points on Curves over Finite Fields. - Ming-Deh A. Huang; Doug Ierardi (J. Symb. Comput., 1998)

Solvability of systems of polynomial congruences modulo a large prime. - Ming-Deh A. Huang; Yiu-Chung Wong (Comput. Complex., 1999)

Function Field Sieve Method for Discrete Logarithms over Finite Fields. - Leonard M. Adleman; Ming-Deh A. Huang (Inf. Comput., 1999)

Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings. - Ming-Deh A. Huang; Chaoping Xing (Inf. Comput., 1999)

Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications. - Ming-Deh A. Huang; Ashwin J. Rao (J. Algorithms, 1999)

Solving polynomials by radicals with roots of unity in minimum depth. - Gwoboa Horng; Ming-Deh A. Huang (Math. Comput., 1999)

A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). - Leonard M. Adleman; Jonathan DeMarrais; Ming-Deh A. Huang (Theor. Comput. Sci., 1999)

Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments. - Qi Cheng 001; Ming-Deh A. Huang (ANTS, 2000)

Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem. - Ming-Deh A. Huang; Ka Lam Kueh; Ki-Seng Tan (ANTS, 2000)

Extended Hilbert Irreducibility and Its Applications. - Ming-Deh A. Huang; Yiu-Chung Wong (J. Algorithms, 2000)

Running time and program size for self-assembled squares. - Leonard M. Adleman; Qi Cheng 001; Ashish Goel; Ming-Deh A. Huang (STOC, 2001)

Counting Points on Curves and Abelian Varieties Over Finite Fields. - Leonard M. Adleman; Ming-Deh A. Huang (J. Symb. Comput., 2001)

Combinatorial optimization problems in self-assembly. - Leonard M. Adleman; Qi Cheng 001; Ashish Goel; Ming-Deh A. Huang; David Kempe 001; Pablo Moisset de Espanés; Paul W. K. Rothemund (STOC, 2002)

Invadable self-assembly: combining robustness with efficiency. - Ho-Lin Chen; Qi Cheng 001; Ashish Goel; Ming-Deh A. Huang; Pablo Moisset de Espanés (SODA, 2004)

On counting and generating curves over small finite fields. - Qi Cheng 001; Ming-Deh A. Huang (J. Complex., 2004)

Signature Calculus and Discrete Logarithm Problems. - Ming-Deh A. Huang; Wayne Raskind (ANTS, 2006)

Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. - Qi Cheng 001; Ming-Deh A. Huang (Algorithmica, 2006)

Folded Algebraic Geometric Codes From Galois Extensions - Ming-Deh A. Huang; Anand Kumar Narayanan (CoRR, 2009)

Global Duality, Signature Calculus and the Discrete Logarithm Problem. - Ming-Deh A. Huang; Wayne Raskind (LMS J. Comput. Math., 2009)

Local Duality and the Discrete Logarithm Problem. - Ming-Deh A. Huang (IWCC, 2011)

On the relation generation method of Joux for computing discrete logarithms. - Ming-Deh A. Huang; Anand Kumar Narayanan (CoRR, 2013)

Finding Primitive Elements in Finite Fields of Small Characteristic - Ming-Deh A. Huang; Anand Kumar Narayanan (CoRR, 2013)

Computing discrete logarithms in subfields of residue class rings. - Ming-Deh A. Huang; Anand Kumar Narayanan (CoRR, 2014)

On þ-adic Expansions of Algebraic Integers. - Hsing-Hau Chen; Ming-Deh A. Huang (ISSAC, 2015)

Last fall degree, HFE, and Weil descent attacks on ECDLP. - Ming-Deh A. Huang; Michiel Kosters; Sze Ling Yeo (IACR Cryptol. ePrint Arch., 2015)

Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields. - Ming-Deh A. Huang; Lian Liu (ISSAC, 2016)

Trilinear maps for cryptography. - Ming-Deh A. Huang (CoRR, 2018)

Trilinear maps for cryptography II. - Ming-Deh A. Huang (CoRR, 2018)

Finding roots of a multivariate polynomial in a linear subspace. - Ming-Deh A. Huang (Finite Fields Their Appl., 2018)

On the last fall degree of zero-dimensional Weil descent systems. - Ming-Deh A. Huang; Michiel Kosters; Yun Yang; Sze Ling Yeo (J. Symb. Comput., 2018)

Generating sets for the multiplicative groups of algebras over finite fields and expander graphs. - Ming-Deh A. Huang; Lian Liu (J. Symb. Comput., 2018)

Weil descent and cryptographic trilinear maps. - Ming-Deh A. Huang (CoRR, 2019)

Algebraic blinding and cryptographic trilinear maps. - Ming-Deh A. Huang (CoRR, 2020)

Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem. - Ming-Deh A. Huang; Michiel Kosters; Christophe Petit 001; Sze Ling Yeo; Yang Yun (J. Math. Cryptol., 2020)

On the last fall degree of Weil descent polynomial systems. - Ming-Deh A. Huang (Finite Fields Their Appl., 2021)

Last fall degree of semi-local polynomial systems. - Ming-Deh A. Huang (CoRR, 2023)

On product decomposition. - Ming-Deh A. Huang (Inf. Process. Lett., 2023)

On semi-local decomposition. - Ming-Deh A. Huang (J. Symb. Comput., 2026)