Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Shuhong Gao
2010 – today
- 2013
[j28]Shuhong Gao, Raymond Heindl: Multivariate public key cryptosystems from diophantine equations. Des. Codes Cryptography 67(1): 1-18 (2013)- [j27]Lin You, Shuhong Gao, Hui Xue: Characteristic polynomials of the curve v2 0 up- au-b over finite fields of characteristic p. Finite Fields and Their Applications 21: 35-49 (2013)
- [j26]Luiz Emilio Allem, Shuhong Gao, Vilmar Trevisan: Extracting sparse factors from multivariate integral polynomials. J. Symb. Comput. 52: 3-16 (2013)
- 2012
- [j25]Chunming Tang, Shuhong Gao: Leakproof secret sharing protocols with applications to group identification scheme. SCIENCE CHINA Information Sciences 55(5): 1172-1185 (2012)
- [c9]Qi Cheng, Shuhong Gao, Daqing Wan: Constructing high order elements through subspace polynomials. SODA 2012: 1457-1463
- 2011
- [j24]Mingfu Zhu, Guangran Jiang, Shuhong Gao: Solving the 100 Swiss Francs Problem. Mathematics in Computer Science 5(2): 195-207 (2011)
- [i2]Chunming Tang, Shuhong Gao, Chengli Zhang: The Optimal Linear Secret Sharing Scheme for Any Given Access Structure. IACR Cryptology ePrint Archive 2011: 147 (2011)
- 2010
- [j23]Chunming Tang, Shuhong Gao: Secure Multi-Party Proof and its Applications. JSEA 3(7): 709-717 (2010)
- [j22]Shuhong Gao, Todd Mateer: Additive Fast Fourier Transforms Over Finite Fields. IEEE Transactions on Information Theory 56(12): 6265-6272 (2010)
- [c8]Shuhong Gao, Yinhua Guan, Frank Volny: A new incremental algorithm for computing Groebner bases. ISSAC 2010: 13-19
- [i1]Shuhong Gao, Frank Volny, Mingsheng Wang: A new algorithm for computing Groebner bases. IACR Cryptology ePrint Archive 2010: 641 (2010)
2000 – 2009
- 2009
- [j21]Shuhong Gao, D. Frank Hsu: Short containers in Cayley graphs. Discrete Applied Mathematics 157(7): 1354-1363 (2009)
- [j20]Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao, Justine C. Hyde-Volpe, Kevin James, Hiren Maharaj, Shelly Manber, Jared Ruiz, Ethan Smith: Finite field elements of high order arising from modular curves. Des. Codes Cryptography 51(3): 301-314 (2009)
- [j19]Shuhong Gao, Daqing Wan, Mingsheng Wang: Primary decomposition of zero-dimensional ideals over finite fields. Math. Comput. 78(265): 509-521 (2009)
- [c7]Eddie Cheng, Shuhong Gao, Ke Qiu, Zhizhang Shen: On Disjoint Shortest Paths Routing on the Hypercube. COCOA 2009: 375-383
- 2008
- [j18]Guantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu: Linked graphs with restricted lengths. J. Comb. Theory, Ser. B 98(4): 735-751 (2008)
- 2006
- [j17]Jeffrey B. Farr, Shuhong Gao: Gröbner bases and generalized Padé approximation. Math. Comput. 75(253): 461-473 (2006)
- [c6]Jeffrey B. Farr, Shuhong Gao: Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points. AAECC 2006: 118-127
- 2004
- [j16]Shuhong Gao, Erich Kaltofen, Alan G. B. Lauder: Deterministic distinct-degree factorization of polynomials over finite fields. J. Symb. Comput. 38(6): 1461-1470 (2004)
- [c5]Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder: Factoring polynomials via polytopes. ISSAC 2004: 4-11
- [c4]Shuhong Gao, Erich Kaltofen, John May, Zhengfeng Yang, Lihong Zhi: Approximate factorization of multivariate polynomials via differential equations. ISSAC 2004: 167-174
- 2003
- [j15]Shuhong Gao: Factoring multivariate polynomials via partial differential equations. Math. Comput. 72(242): 801-822 (2003)
- [j14]Richard P. Brent, Shuhong Gao, Alan G. B. Lauder: Random Krylov Spaces over Finite Fields. SIAM J. Discrete Math. 16(2): 276-287 (2003)
- 2002
- [j13]Shuhong Gao, Alan G. B. Lauder: Hensel lifting and bivariate polynomial factorisation over finite fields. Math. Comput. 71(240): 1663-1676 (2002)
- [j12]Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao: Finite Field Multiplier Using Redundant Representation. IEEE Trans. Computers 51(11): 1306-1316 (2002)
- 2001
- [j11]Shuhong Gao, Alan G. B. Lauder: Decomposition of Polytopes and Polynomials. Discrete & Computational Geometry 26(1): 89-104 (2001)
- [j10]Shuhong Gao: On the Deterministic Complexity of Factoring Polynomials. J. Symb. Comput. 31(1/2): 19-36 (2001)
- 2000
- [j9]Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup: Algorithms for Exponentiation in Finite Fields. J. Symb. Comput. 29(6): 879-889 (2000)
1990 – 1999
- 1999
- [j8]Shuhong Gao, Jason Howell: A General Polynomial Sieve. Des. Codes Cryptography 18(1/3): 149-157 (1999)
- 1998
- [j7]Shuhong Gao, Beth Novick, Ke Qiu: From Hall's Matching Theorem to Optimal Routing on Hypercubes. J. Comb. Theory, Ser. B 74(2): 291-301 (1998)
- [j6]Shuhong Gao, Joachim von zur Gathen, Daniel Panario: Gauss periods: orders and cryptographical applications. Math. Comput. 67(221): 343-352 (1998)
- 1995
- [c3]Shuhong Gao, Joachim von zur Gathen, Daniel Panario: Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract). LATIN 1995: 311-322
- 1994
- [j5]Ian F. Blake, Shuhong Gao, Ronald C. Mullin: Normal and Self-dual Normal Bases from Factorization of c xq+1 + d xq - ax - b. SIAM J. Discrete Math. 7(3): 499-512 (1994)
- [c2]
- 1993
- [j4]Ian F. Blake, Shuhong Gao, Ronald C. Mullin: Explicit Factorization of x2k + 1 over Fp with Prime p= 3 mod 4. Appl. Algebra Eng. Commun. Comput. 4: 89-94 (1993)
- [j3]Shuhong Gao, Wan-Di Wei: On non-Abelian group difference sets. Discrete Mathematics 112(1-3): 93-102 (1993)
- [j2]Wan-Di Wei, Shuhong Gao, Benfu Yang: Cyclic near difference sets of type 1. Discrete Mathematics 123(1-3): 151-177 (1993)
- [c1]Ian F. Blake, Shuhong Gao, Robert J. Lambert: Constructive problems for irreducible polynominals over finite fields. Information Theory and Applications 1993: 1-23
- 1992
- [j1]Shuhong Gao, Hendrik W. Lenstra Jr.: Optimal Normal Bases. Des. Codes Cryptography 2(4): 315-323 (1992)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-17 21:48 CEST by the dblp team