default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShuhong Gao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i15]Kaimin Cheng, Shuhong Gao:
On binomial Weil sums and an application. CoRR abs/2409.13515 (2024)- [i14]Shuhong Gao, Kyle Yates:
Leveled Homomorphic Encryption Schemes for Homomorphic Encryption Standard. IACR Cryptol. ePrint Arch. 2024: 991 (2024) - 2023
- [i13]Pengbo Li, Ting Gao, Huifang Huang, Jiani Cheng, Shuhong Gao, Zhigang Zeng, Jinqiao Duan
:
Privacy-Preserving Discretized Spiking Neural Networks. CoRR abs/2308.12529 (2023) - 2022
- [j44]Cong Deng, Lin You, Xianghong Tang, Gengran Hu, Shuhong Gao:
Cuproof: Range Proof with Constant Size. Entropy 24(3): 334 (2022) - 2021
- [j43]Weihang Tan, Benjamin M. Case, Antian Wang, Shuhong Gao, Yingjie Lao:
High-Speed Modular Multiplier for Lattice-Based Cryptosystems. IEEE Trans. Circuits Syst. II Express Briefs 68(8): 2927-2931 (2021) - [j42]Weihang Tan, Benjamin M. Case, Gengran Hu, Shuhong Gao, Yingjie Lao:
An Ultra-Highly Parallel Polynomial Multiplier for the Bootstrapping Algorithm in a Fully Homomorphic Encryption Scheme. J. Signal Process. Syst. 93(6): 643-656 (2021) - 2020
- [j41]Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas:
The complexity of subdivision for diameter-distance tests. J. Symb. Comput. 101: 1-27 (2020) - [j40]Jingwei Zhang, Shuhong Gao, Chang-An Zhao:
Linear Complexity of a Family of Binary pq2-Periodic Sequences From Euler Quotients. IEEE Trans. Inf. Theory 66(9): 5774-5780 (2020)
2010 – 2019
- 2019
- [j39]Yao Chen, Benjamin M. Case, Shuhong Gao, Guang Gong:
Error analysis of weak Poly-LWE instances. Cryptogr. Commun. 11(3): 411-426 (2019) - [i12]Jingwei Zhang, Shuhong Gao, Changan Zhao:
Linear Complexity of A Family of Binary pq2-periodic Sequences From Euler Quotients. CoRR abs/1906.08083 (2019) - [i11]Benjamin M. Case, Colin M. Gallagher, Shuhong Gao:
A Note on Sub-Gaussian Random Variables. IACR Cryptol. ePrint Arch. 2019: 520 (2019) - [i10]Benjamin M. Case, Shuhong Gao, Gengran Hu, Qiuxia Xu:
Fully Homomorphic Encryption with k-bit Arithmetic Operations. IACR Cryptol. ePrint Arch. 2019: 521 (2019) - [i9]Jingwei Zhang, Shuhong Gao, Chang-An Zhao:
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients. IACR Cryptol. ePrint Arch. 2019: 729 (2019) - 2018
- [j38]Michael A. Burr, Shuhong Gao, Fiona Knoll:
Optimal Bounds for Johnson-Lindenstrauss Transformations. J. Mach. Learn. Res. 19: 73:1-73:22 (2018) - [j37]Michael Dowling, Shuhong Gao:
Fast Decoding of Expander Codes. IEEE Trans. Inf. Theory 64(2): 972-978 (2018) - [i8]Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas:
The Complexity of Subdivision for Diameter-Distance Tests. CoRR abs/1801.05864 (2018) - [i7]Michael A. Burr, Shuhong Gao, Fiona Knoll:
Optimal Bounds for Johnson-Lindenstrauss Transformations. CoRR abs/1803.05350 (2018) - [i6]Shuhong Gao:
Efficient Fully Homomorphic Encryption Scheme. IACR Cryptol. ePrint Arch. 2018: 637 (2018) - 2017
- [j36]Shuhong Gao, Fiona Knoll, Felice Manganiello, Gretchen L. Matthews:
Codes for distributed storage from 3-regular graphs. Discret. Appl. Math. 229: 82-89 (2017) - [j35]Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan:
Sparse univariate polynomials with many roots over finite fields. Finite Fields Their Appl. 46: 235-246 (2017) - [c10]Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas:
The Complexity of an Adaptive Subdivision Method for Approximating Real Curves. ISSAC 2017: 61-68 - [i5]Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan:
Counting Roots of Polynomials Over Prime Power Rings. CoRR abs/1711.01355 (2017) - 2016
- [j34]Shuhong Gao, Frank Volny IV, Mingsheng Wang:
A new framework for computing Gröbner bases. Math. Comput. 85(297): 449-465 (2016) - [i4]Shuhong Gao, Fiona Knoll, Felice Manganiello, Gretchen L. Matthews:
Codes for distributed storage from 3-regular graphs. CoRR abs/1610.00043 (2016) - 2014
- [j33]Lin You, Yilin Yang, Shuhong Gao, Yongxuan Sang:
Fast Scalar Multiplications on the Curve v2 = up - au - b over the Finite Field of Characteristic p. Fundam. Informaticae 129(4): 395-412 (2014) - [i3]Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan:
Sparse Univariate Polynomials with Many Roots Over Finite Fields. CoRR abs/1411.6346 (2014) - 2013
- [j32]Shuhong Gao, Raymond Heindl:
Multivariate public key cryptosystems from diophantine equations. Des. Codes Cryptogr. 67(1): 1-18 (2013) - [j31]Lin You, Shuhong Gao, Hui Xue:
Characteristic polynomials of the curve v2 0 up- au-b over finite fields of characteristic p. Finite Fields Their Appl. 21: 35-49 (2013) - [j30]Chunming Tang, Shuhong Gao, Chengli Zhang:
The optimal linear secret sharing scheme for any given access structure. J. Syst. Sci. Complex. 26(4): 634-649 (2013) - [j29]Luiz Emilio Allem, Shuhong Gao, Vilmar Trevisan:
Extracting sparse factors from multivariate integral polynomials. J. Symb. Comput. 52: 3-16 (2013) - [p2]Shuhong Gao, Qunying Liao:
Normal bases. Handbook of Finite Fields 2013: 109-116 - [p1]Shuhong Gao, David Thomson:
Complexity of normal bases. Handbook of Finite Fields 2013: 117-127 - 2012
- [j28]Chunming Tang, Shuhong Gao:
Leakproof secret sharing protocols with applications to group identification scheme. Sci. China Inf. Sci. 55(5): 1172-1185 (2012) - [c9]Qi Cheng, Shuhong Gao, Daqing Wan:
Constructing high order elements through subspace polynomials. SODA 2012: 1457-1463 - 2011
- [j27]Mingfu Zhu, Guangran Jiang, Shuhong Gao:
Solving the 100 Swiss Francs Problem. Math. Comput. Sci. 5(2): 195-207 (2011) - [i2]Chunming Tang, Shuhong Gao, Chengli Zhang:
The Optimal Linear Secret Sharing Scheme for Any Given Access Structure. IACR Cryptol. ePrint Arch. 2011: 147 (2011) - 2010
- [j26]Chunming Tang, Shuhong Gao:
Secure Multi-Party Proof and its Applications. J. Softw. Eng. Appl. 3(7): 709-717 (2010) - [j25]Shuhong Gao, Todd D. Mateer:
Additive Fast Fourier Transforms Over Finite Fields. IEEE Trans. Inf. 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 Cryptol. ePrint Arch. 2010: 641 (2010)
2000 – 2009
- 2009
- [j24]Shuhong Gao, D. Frank Hsu:
Short containers in Cayley graphs. Discret. Appl. Math. 157(7): 1354-1363 (2009) - [j23]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 Cryptogr. 51(3): 301-314 (2009) - [j22]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
- [j21]Shuhong Gao, Mingfu Zhu:
An incremental algorithm for irreducible decompositions of monomial ideals (abstract only). ACM Commun. Comput. Algebra 42(1-2): 70 (2008) - [j20]Dongmei Li, Jinwang Liu, Shuhong Gao:
The w-gröbner bases and monomial ideal under polynomial composition (abstract only). ACM Commun. Comput. Algebra 42(1-2): 81-82 (2008) - [j19]Guantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu:
Linked graphs with restricted lengths. J. Comb. Theory B 98(4): 735-751 (2008) - 2006
- [j18]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 - 2005
- [j17]Shuhong Gao, Mingfu Zhu:
Irreducible decomposition of monomial ideals. SIGSAM Bull. 39(3): 99 (2005) - 2004
- [j16]Shuhong Gao, Erich L. 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 L. Kaltofen, John P. 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. Discret. 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. Discret. Comput. Geom. 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 Cryptogr. 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 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. Discret. Math. 7(3): 499-512 (1994) - [c2]Shuhong Gao, Scott A. Vanstone:
On orders of optimal normal basis generators. ANTS 1994: 220 - 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. Discret. Math. 112(1-3): 93-102 (1993) - [j2]Wan-Di Wei, Shuhong Gao, Benfu Yang:
Cyclic near difference sets of type 1. Discret. Math. 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 Cryptogr. 2(4): 315-323 (1992)
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-10-22 20:07 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:
