Zobrazeno 1 - 10
of 95
pro vyhledávání: '"Huang Ming-Deh"'
Publikováno v:
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 25-38 (2020)
We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus
Externí odkaz:
https://doaj.org/article/75a4ced306114d568b832c4b20d00fd7
Autor:
Huang, Ming-Deh A.
We study the last fall degrees of {\em semi-local} polynomial systems, and the computational complexity of solving such systems for closed-point and rational-point solutions, where the systems are defined over a finite field. A semi-local polynomial
Externí odkaz:
http://arxiv.org/abs/2311.02804
Autor:
Huang, Ming-Deh A.
Given a finite set $W$ in $\bar{k}^n$ where $\bar{k}$ is the algebraic closure of a field $k$ one would like to determine if $W$ can be decomposed as $\prod_{i=1}^n V_i$ where $V_i \subset \bar{k}$ under a linear transformation, that is, $W\stackrel{
Externí odkaz:
http://arxiv.org/abs/2201.00653
Autor:
Huang, Ming-Deh
Given a polynomial system $\mathcal{F}$ over a finite field $k$ which is not necessarily of dimension zero, we consider the Weil descent $\mathcal{F}'$ of $\mathcal{F}$ over a subfield $k'$. We prove a theorem which relates the last fall degrees of $
Externí odkaz:
http://arxiv.org/abs/2103.07282
Autor:
Huang, Ming-Deh A.
It has been shown recently that cryptographic trilinear maps are sufficient for achieving indistinguishability obfuscation. In this paper we develop algebraic blinding techniques for constructing such maps. An earlier approach involving Weil restrict
Externí odkaz:
http://arxiv.org/abs/2002.07923
Autor:
Huang, Ming-Deh A.
It has recently been shown that cryptographic trilinear maps are sufficient for achieving indistinguishability obfuscation. In this paper we develop a method for constructing such maps on the Weil descent (restriction) of abelian varieties over finit
Externí odkaz:
http://arxiv.org/abs/1908.06891
Autor:
Huang, Ming-Deh A.
We continue to study the construction of cryptographic trilinear maps involving abelian varieties over finite fields. We introduce Weil descent as a tool to strengthen the security of a trilinear map. We form the trilinear map on the descent variety
Externí odkaz:
http://arxiv.org/abs/1810.03646
Autor:
Huang, Ming-Deh A.
We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is based on a
Externí odkaz:
http://arxiv.org/abs/1803.10325
In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gr\"obner basis computations and the heuristic first fall degree assumption and is not based on any heuristic.
Externí odkaz:
http://arxiv.org/abs/1505.02532