Ming-Deh A. Huang

According to our database, Ming-Deh A. Huang authored at least 61 papers between 1984 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

On product decomposition.

Ming-Deh A. Huang

Inf. Process. Lett., March, 2023

Last fall degree of semi-local polynomial systems.

Ming-Deh A. Huang

CoRR, 2023

2021

On the last fall degree of Weil descent polynomial systems.

Ming-Deh A. Huang

Finite Fields Their Appl., 2021

2020

Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem.

Ming-Deh A. Huang, Michiel Kosters, Christophe Petit, Sze Ling Yeo, Yang Yun

J. Math. Cryptol., 2020

Algebraic blinding and cryptographic trilinear maps.

Ming-Deh A. Huang

CoRR, 2020

2019

Weil descent and cryptographic trilinear maps.

Ming-Deh A. Huang

CoRR, 2019

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

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

Finding roots of a multivariate polynomial in a linear subspace.

Ming-Deh A. Huang

Finite Fields Their Appl., 2018

Trilinear maps for cryptography II.

Ming-Deh A. Huang

CoRR, 2018

Trilinear maps for cryptography.

Ming-Deh A. Huang

CoRR, 2018

2016

Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields.

Ming-Deh A. Huang, Lian Liu

Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation, 2016

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

On þ-adic Expansions of Algebraic Integers.

Hsing-Hau Chen, Ming-Deh A. Huang

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

Computing discrete logarithms in subfields of residue class rings.

Ming-Deh A. Huang, Anand Kumar Narayanan

CoRR, 2014

2013

Finding Primitive Elements in Finite Fields of Small Characteristic

Ming-Deh A. Huang, Anand Kumar Narayanan

CoRR, 2013

On the relation generation method of Joux for computing discrete logarithms.

Ming-Deh A. Huang, Anand Kumar Narayanan

CoRR, 2013

2011

Local Duality and the Discrete Logarithm Problem.

Ming-Deh A. Huang

Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2009

Global Duality, Signature Calculus and the Discrete Logarithm Problem.

Ming-Deh A. Huang, Wayne Raskind

LMS J. Comput. Math., 2009

Folded Algebraic Geometric Codes From Galois Extensions

Ming-Deh A. Huang, Anand Kumar Narayanan

CoRR, 2009

2006

Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.

Qi Cheng, Ming-Deh A. Huang

Algorithmica, 2006

Signature Calculus and Discrete Logarithm Problems.

Ming-Deh A. Huang, Wayne Raskind

Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2004

On counting and generating curves over small finite fields.

Qi Cheng, Ming-Deh A. Huang

J. Complex., 2004

Invadable self-assembly: combining robustness with efficiency.

Ho-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002

Combinatorial optimization problems in self-assembly.

Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001

Counting Points on Curves and Abelian Varieties Over Finite Fields.

Leonard M. Adleman, Ming-Deh A. Huang

J. Symb. Comput., 2001

Running time and program size for self-assembled squares.

Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

Extended Hilbert Irreducibility and Its Applications.

Ming-Deh A. Huang, Yiu-Chung Wong

J. Algorithms, 2000

Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem.

Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments.

Qi Cheng, Ming-Deh A. Huang

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

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

Solving polynomials by radicals with roots of unity in minimum depth.

Gwoboa Horng, Ming-Deh A. Huang

Math. Comput., 1999

Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications.

Ming-Deh A. Huang, Ashwin J. Rao

J. Algorithms, 1999

Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings.

Ming-Deh A. Huang, Chaoping Xing

Inf. Comput., 1999

Function Field Sieve Method for Discrete Logarithms over Finite Fields.

Leonard M. Adleman, Ming-Deh A. Huang

Inf. Comput., 1999

Solvability of systems of polynomial congruences modulo a large prime.

Ming-Deh A. Huang, Yiu-Chung Wong

Comput. Complex., 1999

1998

Counting Points on Curves over Finite Fields.

Ming-Deh A. Huang, Doug Ierardi

J. Symb. Comput., 1998

A Black Box Approach to the Algebraic Set Decomposition Problem.

Ming-Deh A. Huang, Ashwin J. Rao

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

An Algorithm for Approximate Counting of Points on Algebraic Sets over Finite Fields.

Ming-Deh A. Huang, Yiu-Chung Wong

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997

Quantum Computability.

Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang

SIAM J. Comput., 1997

1996

Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract).

Ming-Deh A. Huang, Yiu-Chung Wong

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

Counting Rational Points on Curves and Abelian Varieties over Finite Fields.

Leonard M. Adleman, Ming-Deh A. Huang

Proceedings of the Algorithmic Number Theory, Second International Symposium, 1996

1995

Efficient Checkers for Number-Theoretic Computations

Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella

Inf. Comput., August, 1995

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 checking of computations in number theory.

Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

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

Proceedings of the Algorithmic Number Theory, First International Symposium, 1994

1993

Counting Rational Points on Curves over Finite Fields (Extended Abstract)

Ming-Deh A. Huang, Doug Ierardi

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1991

Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields.

Ming-Deh A. Huang

J. Algorithms, 1991

Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields.

Ming-Deh A. Huang

J. Algorithms, 1991

Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve (Extended Abstract)

Ming-Deh A. Huang, Doug Ierardi

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990

Security, Verifiability, and Universality in Distributed Computing.

Ming-Deh A. Huang, Shang-Hua Teng

J. Algorithms, 1990

Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum Depth

Gwoboa Horng, Ming-Deh A. Huang

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1988

Secure and Verifiable Schemes for Election and General Distributed Computing Problems.

Ming-Deh A. Huang, Shang-Hua Teng

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

A Universal Problem in Secure and Verifiable Distributed Computation.

Ming-Deh A. Huang, Shang-Hua Teng

Proceedings of the Advances in Cryptology, 1988

Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks.

Alok Aggarwal, Ming-Deh A. Huang

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

Recognizing Primes in Random Polynomial Time

Leonard M. Adleman, Ming-Deh A. Huang

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1985

Implications of Forbidden Structures for Extremal Algorithmic Problems.

Ming-Deh A. Huang, Karl J. Lieberherr

Theor. Comput. Sci., 1985

Riemann Hypothesis and Finding Roots over Finite Fields

Ming-Deh A. Huang

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Networks

Ming-Deh A. Huang

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984

Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields

Ming-Deh A. Huang

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

On a Simple Primality Testing Algorithm.

Ming-Deh A. Huang

Proceedings of the EUROSAM 84, 1984