default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMing-Deh A. Huang
Person information
- affiliation: University of Southern California, Los Angeles, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j25]Ming-Deh A. Huang
:
On product decomposition. Inf. Process. Lett. 181: 106344 (2023)- [i11]Ming-Deh A. Huang:
Last fall degree of semi-local polynomial systems. CoRR abs/2311.02804 (2023) - 2021
- [j24]Ming-Deh A. Huang:
On the last fall degree of Weil descent polynomial systems. Finite Fields Their Appl. 73: 101836 (2021) - 2020
- [j23]Ming-Deh A. Huang, Michiel Kosters, Christophe Petit, Sze Ling Yeo, Yang Yun:
Quasi-subfield Polynomials and the Elliptic Curve Discrete Logarithm Problem. J. Math. Cryptol. 14(1): 25-38 (2020) - [i10]Ming-Deh A. Huang:
Algebraic blinding and cryptographic trilinear maps. CoRR abs/2002.07923 (2020)
2010 – 2019
- 2019
- [i9]Ming-Deh A. Huang:
Weil descent and cryptographic trilinear maps. CoRR abs/1908.06891 (2019) - 2018
- [j22]Ming-Deh A. Huang:
Finding roots of a multivariate polynomial in a linear subspace. Finite Fields Their Appl. 54: 288-296 (2018) - [j21]Ming-Deh A. Huang, Lian Liu:
Generating sets for the multiplicative groups of algebras over finite fields and expander graphs. J. Symb. Comput. 85: 170-187 (2018) - [j20]Ming-Deh A. Huang, Michiel Kosters, Yun Yang, Sze Ling Yeo:
On the last fall degree of zero-dimensional Weil descent systems. J. Symb. Comput. 87: 207-226 (2018) - [i8]Ming-Deh A. Huang:
Trilinear maps for cryptography. CoRR abs/1803.10325 (2018) - [i7]Ming-Deh A. Huang:
Trilinear maps for cryptography II. CoRR abs/1810.03646 (2018) - 2016
- [c30]Ming-Deh A. Huang, Lian Liu:
Constructing Small Generating Sets for the Multiplicative Groups of Algebras over Finite Fields. ISSAC 2016: 287-294 - 2015
- [c29]Ming-Deh A. Huang, Michiel Kosters, Sze Ling Yeo:
Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP. CRYPTO (1) 2015: 581-600 - [c28]Hsing-Hau Chen, Ming-Deh A. Huang:
On þ-adic Expansions of Algebraic Integers. ISSAC 2015: 109-116 - [i6]Ming-Deh A. Huang, Michiel Kosters, Yun Yang, Sze Ling Yeo:
On the last fall degree of zero-dimensional Weil descent systems. CoRR abs/1505.02532 (2015) - [i5]Ming-Deh A. Huang, Michiel Kosters, Sze Ling Yeo:
Last fall degree, HFE, and Weil descent attacks on ECDLP. IACR Cryptol. ePrint Arch. 2015: 573 (2015) - 2014
- [i4]Ming-Deh A. Huang, Anand Kumar Narayanan:
Computing discrete logarithms in subfields of residue class rings. CoRR abs/1402.6658 (2014) - 2013
- [i3]Ming-Deh A. Huang, Anand Kumar Narayanan:
Finding Primitive Elements in Finite Fields of Small Characteristic. CoRR abs/1304.1206 (2013) - [i2]Ming-Deh A. Huang, Anand Kumar Narayanan:
On the relation generation method of Joux for computing discrete logarithms. CoRR abs/1312.1674 (2013) - 2011
- [c27]Ming-Deh A. Huang:
Local Duality and the Discrete Logarithm Problem. IWCC 2011: 213-222
2000 – 2009
- 2009
- [j19]Ming-Deh A. Huang, Wayne Raskind:
Global Duality, Signature Calculus and the Discrete Logarithm Problem. LMS J. Comput. Math. 12: 228-263 (2009) - [i1]Ming-Deh A. Huang, Anand Kumar Narayanan:
Folded Algebraic Geometric Codes From Galois Extensions. CoRR abs/0901.1162 (2009) - 2006
- [j18]Qi Cheng, Ming-Deh A. Huang:
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. Algorithmica 46(1): 59-68 (2006) - [c26]Ming-Deh A. Huang, Wayne Raskind:
Signature Calculus and Discrete Logarithm Problems. ANTS 2006: 558-572 - 2004
- [j17]Qi Cheng, Ming-Deh A. Huang:
On counting and generating curves over small finite fields. J. Complex. 20(2-3): 284-296 (2004) - [c25]Qi Cheng, Ming-Deh A. Huang:
On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem. ISAAC 2004: 342-351 - [c24]Ho-Lin Chen, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, Pablo Moisset de Espanés:
Invadable self-assembly: combining robustness with efficiency. SODA 2004: 890-899 - 2002
- [c23]Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang, David Kempe, Pablo Moisset de Espanés, Paul W. K. Rothemund:
Combinatorial optimization problems in self-assembly. STOC 2002: 23-32 - 2001
- [j16]Leonard M. Adleman, Ming-Deh A. Huang:
Counting Points on Curves and Abelian Varieties Over Finite Fields. J. Symb. Comput. 32(3): 171-189 (2001) - [c22]Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-Deh A. Huang:
Running time and program size for self-assembled squares. STOC 2001: 740-748 - 2000
- [j15]Ming-Deh A. Huang, Yiu-Chung Wong:
Extended Hilbert Irreducibility and Its Applications. J. Algorithms 37(1): 121-145 (2000) - [c21]Qi Cheng, Ming-Deh A. Huang:
Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments. ANTS 2000: 233-246 - [c20]Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan:
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem. ANTS 2000: 377-384
1990 – 1999
- 1999
- [j14]Ming-Deh A. Huang, Yiu-Chung Wong:
Solvability of systems of polynomial congruences modulo a large prime. Comput. Complex. 8(3): 227-257 (1999) - [j13]Leonard M. Adleman, Ming-Deh A. Huang:
Function Field Sieve Method for Discrete Logarithms over Finite Fields. Inf. Comput. 151(1-2): 5-16 (1999) - [j12]Ming-Deh A. Huang, Chaoping Xing:
Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings. Inf. Comput. 151(1-2): 92-99 (1999) - [j11]Ming-Deh A. Huang, Ashwin J. Rao:
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications. J. Algorithms 33(2): 204-228 (1999) - [j10]Gwoboa Horng, Ming-Deh A. Huang:
Solving polynomials by radicals with roots of unity in minimum depth. Math. Comput. 68(226): 881-885 (1999) - [j9]Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang:
A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q). Theor. Comput. Sci. 226(1-2): 7-18 (1999) - 1998
- [j8]Ming-Deh A. Huang, Doug Ierardi:
Counting Points on Curves over Finite Fields. J. Symb. Comput. 25(1): 1-21 (1998) - [c19]Ming-Deh A. Huang, Yiu-Chung Wong:
An Algorithm for Approximate Counting of Points on Algebraic Sets over Finite Fields. ANTS 1998: 514-527 - [c18]Ming-Deh A. Huang, Yiu-Chung Wong:
Extended Hilbert Irreducibility and its Applications. SODA 1998: 50-58 - [c17]Ming-Deh A. Huang, Ashwin J. Rao:
A Black Box Approach to the Algebraic Set Decomposition Problem. STOC 1998: 497-506 - 1997
- [j7]Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang:
Quantum Computability. SIAM J. Comput. 26(5): 1524-1540 (1997) - 1996
- [c16]Leonard M. Adleman, Ming-Deh A. Huang:
Counting Rational Points on Curves and Abelian Varieties over Finite Fields. ANTS 1996: 1-16 - [c15]Ming-Deh A. Huang, Yiu-Chung Wong:
Solving Systems of Polynomial Congruences Modulo a Large Prime (extended abstract). FOCS 1996: 115-124 - [c14]Ming-Deh A. Huang, Ashwin J. Rao:
Interpolation of Sparse Multivariate Polynomials over Large Finite Fields with Applications. SODA 1996: 508-517 - 1995
- [j6]Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella:
Efficient Checkers for Number-Theoretic Computations. Inf. Comput. 121(1): 93-102 (1995) - 1994
- [j5]Ming-Deh A. Huang, Doug Ierardi:
Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve. J. Symb. Comput. 18(6): 519-539 (1994) - [c13]Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang:
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. ANTS 1994: 28-40 - [c12]Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella:
Efficient checking of computations in number theory. ANTS 1994: 249 - [e1]Leonard M. Adleman, Ming-Deh A. Huang:
Algorithmic Number Theory, First International Symposium, ANTS-I, Ithaca, NY, USA, May 6-9, 1994, Proceedings. Lecture Notes in Computer Science 877, Springer 1994, ISBN 3-540-58691-1 [contents] - 1993
- [c11]Ming-Deh A. Huang, Doug Ierardi:
Counting Rational Points on Curves over Finite Fields (Extended Abstract). FOCS 1993: 616-625 - 1991
- [j4]Ming-Deh A. Huang:
Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields. J. Algorithms 12(3): 464-481 (1991) - [j3]Ming-Deh A. Huang:
Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields. J. Algorithms 12(3): 482-489 (1991) - [c10]Ming-Deh A. Huang, Doug Ierardi:
Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve (Extended Abstract). FOCS 1991: 678-687 - 1990
- [j2]Ming-Deh A. Huang, Shang-Hua Teng:
Security, Verifiability, and Universality in Distributed Computing. J. Algorithms 11(3): 492-521 (1990) - [c9]Gwoboa Horng, Ming-Deh A. Huang:
Simplifying Nested Radicals and Solving Polynomials by Radicals in Minimum Depth. FOCS 1990: 847-856
1980 – 1989
- 1988
- [c8]Alok Aggarwal, Ming-Deh A. Huang:
Network Complexity of Sorting and Graph Problems and Simulating CRCW PRAMS by Interconnection Networks. AWOC 1988: 339-350 - [c7]Ming-Deh A. Huang, Shang-Hua Teng:
A Universal Problem in Secure and Verifiable Distributed Computation. CRYPTO 1988: 336-352 - [c6]Ming-Deh A. Huang, Shang-Hua Teng:
Secure and Verifiable Schemes for Election and General Distributed Computing Problems. PODC 1988: 182-196 - 1987
- [c5]Leonard M. Adleman, Ming-Deh A. Huang:
Recognizing Primes in Random Polynomial Time. STOC 1987: 462-469 - 1985
- [j1]Ming-Deh A. Huang, Karl J. Lieberherr:
Implications of Forbidden Structures for Extremal Algorithmic Problems. Theor. Comput. Sci. 40: 195-210 (1985) - [c4]Ming-Deh A. Huang:
Solving Some Graph Problems with Optimal or Near-Optimal Speedup on Mesh-of-Trees Networks. FOCS 1985: 232-240 - [c3]Ming-Deh A. Huang:
Riemann Hypothesis and Finding Roots over Finite Fields. STOC 1985: 121-130 - 1984
- [c2]Ming-Deh A. Huang:
On a Simple Primality Testing Algorithm. EUROSAM 1984: 321-332 - [c1]Ming-Deh A. Huang:
Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields. STOC 1984: 175-182
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:44 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
