Shuhong Gao

According to our database, Shuhong Gao authored at least 66 papers between 1992 and 2025.

Collaborative distances:

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

2025

From accuracy to approximation: A survey on approximate homomorphic encryption and its applications.

Weinan Liu, Lin You, Yunfei Shao, Xinyi Shen, Gengran Hu, Jiawen Shi, Shuhong Gao

Comput. Sci. Rev., 2025

2024

Leveled Homomorphic Encryption Schemes for Homomorphic Encryption Standard.

Shuhong Gao, Kyle Yates

IACR Cryptol. ePrint Arch., 2024

On binomial Weil sums and an application.

Kaimin Cheng, Shuhong Gao

CoRR, 2024

2023

Privacy-Preserving Discretized Spiking Neural Networks.

Pengbo Li, Ting Gao, Huifang Huang, Jiani Cheng, Shuhong Gao, Zhigang Zeng, Jinqiao Duan

CoRR, 2023

2022

Cuproof: Range Proof with Constant Size.

Cong Deng, Lin You, Xianghong Tang, Gengran Hu, Shuhong Gao

Entropy, 2022

2021

An Ultra-Highly Parallel Polynomial Multiplier for the Bootstrapping Algorithm in a Fully Homomorphic Encryption Scheme.

Weihang Tan, Benjamin M. Case, Gengran Hu, Shuhong Gao, Yingjie Lao

J. Signal Process. Syst., 2021

High-Speed Modular Multiplier for Lattice-Based Cryptosystems.

Weihang Tan, Benjamin M. Case, Antian Wang, Shuhong Gao, Yingjie Lao

IEEE Trans. Circuits Syst. II Express Briefs, 2021

2020

Linear Complexity of a Family of Binary pq²-Periodic Sequences From Euler Quotients.

Jingwei Zhang, Shuhong Gao, Chang-An Zhao

IEEE Trans. Inf. Theory, 2020

The complexity of subdivision for diameter-distance tests.

Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas

J. Symb. Comput., 2020

2019

Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients.

Jingwei Zhang, Shuhong Gao, Chang-An Zhao

IACR Cryptol. ePrint Arch., 2019

Fully Homomorphic Encryption with k-bit Arithmetic Operations.

Benjamin M. Case, Shuhong Gao, Gengran Hu, Qiuxia Xu

IACR Cryptol. ePrint Arch., 2019

A Note on Sub-Gaussian Random Variables.

Benjamin M. Case, Colin M. Gallagher, Shuhong Gao

IACR Cryptol. ePrint Arch., 2019

Error analysis of weak Poly-LWE instances.

Yao Chen, Benjamin M. Case, Shuhong Gao, Guang Gong

Cryptogr. Commun., 2019

2018

Fast Decoding of Expander Codes.

Michael Dowling, Shuhong Gao

IEEE Trans. Inf. Theory, 2018

Optimal Bounds for Johnson-Lindenstrauss Transformations.

Michael A. Burr, Shuhong Gao, Fiona Knoll

J. Mach. Learn. Res., 2018

Efficient Fully Homomorphic Encryption Scheme.

Shuhong Gao

IACR Cryptol. ePrint Arch., 2018

2017

Sparse univariate polynomials with many roots over finite fields.

Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan

Finite Fields Their Appl., 2017

Codes for distributed storage from 3-regular graphs.

Shuhong Gao, Fiona Knoll, Felice Manganiello, Gretchen L. Matthews

Discret. Appl. Math., 2017

Counting Roots of Polynomials Over Prime Power Rings.

Qi Cheng, Shuhong Gao, J. Maurice Rojas, Daqing Wan

CoRR, 2017

The Complexity of an Adaptive Subdivision Method for Approximating Real Curves.

Michael A. Burr, Shuhong Gao, Elias P. Tsigaridas

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

2016

A new framework for computing Gröbner bases.

Shuhong Gao, Frank Volny IV, Mingsheng Wang

Math. Comput., 2016

2014

Fast Scalar Multiplications on the Curve v² = u^p - au - b over the Finite Field of Characteristic p.

Lin You, Yilin Yang, Shuhong Gao, Yongxuan Sang

Fundam. Informaticae, 2014

2013

Extracting sparse factors from multivariate integral polynomials.

Luiz Emilio Allem, Shuhong Gao, Vilmar Trevisan

J. Symb. Comput., 2013

The optimal linear secret sharing scheme for any given access structure.

Chunming Tang, Shuhong Gao, Chengli Zhang

J. Syst. Sci. Complex., 2013

Characteristic polynomials of the curve v² 0 u^p- au-b over finite fields of characteristic p.

Lin You, Shuhong Gao, Hui Xue

Finite Fields Their Appl., 2013

Multivariate public key cryptosystems from diophantine equations.

Shuhong Gao, Raymond Heindl

Des. Codes Cryptogr., 2013

Complexity of normal bases.

Shuhong Gao, David Thomson

Proceedings of the Handbook of Finite Fields., 2013

Normal bases.

Shuhong Gao, Qunying Liao

Proceedings of the Handbook of Finite Fields., 2013

2012

Leakproof secret sharing protocols with applications to group identification scheme.

Chunming Tang, Shuhong Gao

Sci. China Inf. Sci., 2012

Constructing high order elements through subspace polynomials.

Qi Cheng, Shuhong Gao, Daqing Wan

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

Solving the 100 Swiss Francs Problem.

Mingfu Zhu, Guangran Jiang, Shuhong Gao

Math. Comput. Sci., 2011

2010

Additive Fast Fourier Transforms Over Finite Fields.

Shuhong Gao, Todd D. Mateer

IEEE Trans. Inf. Theory, 2010

Secure Multi-Party Proof and its Applications.

Chunming Tang, Shuhong Gao

J. Softw. Eng. Appl., 2010

A new algorithm for computing Groebner bases.

Shuhong Gao, Frank Volny, Mingsheng Wang

IACR Cryptol. ePrint Arch., 2010

A new incremental algorithm for computing Groebner bases.

Shuhong Gao, Yinhua Guan, Frank Volny

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009

Primary decomposition of zero-dimensional ideals over finite fields.

Shuhong Gao, Daqing Wan, Mingsheng Wang

Math. Comput., 2009

Finite field elements of high order arising from modular curves.

Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao, Justine C. Hyde-Volpe, Kevin James, Hiren Maharaj, Shelly Manber, Jared Ruiz, Ethan Smith

Des. Codes Cryptogr., 2009

Short containers in Cayley graphs.

Shuhong Gao, D. Frank Hsu

Discret. Appl. Math., 2009

On Disjoint Shortest Paths Routing on the Hypercube.

Eddie Cheng, Shuhong Gao, Ke Qiu, Zhizhang Shen

Proceedings of the Combinatorial Optimization and Applications, 2009

2008

Linked graphs with restricted lengths.

Guantao Chen, Yuan Chen, Shuhong Gao, Zhiquan Hu

J. Comb. Theory B, 2008

The w-gröbner bases and monomial ideal under polynomial composition (abstract only).

Dongmei Li, Jinwang Liu, Shuhong Gao

ACM Commun. Comput. Algebra, 2008

An incremental algorithm for irreducible decompositions of monomial ideals (abstract only).

Shuhong Gao, Mingfu Zhu

ACM Commun. Comput. Algebra, 2008

2006

Gröbner bases and generalized Padé approximation.

Jeffrey B. Farr, Shuhong Gao

Math. Comput., 2006

Computing Gröbner Bases for Vanishing Ideals of Finite Sets of Points.

Jeffrey B. Farr, Shuhong Gao

Proceedings of the Applied Algebra, 2006

2005

Irreducible decomposition of monomial ideals.

Shuhong Gao, Mingfu Zhu

SIGSAM Bull., 2005

2004

Deterministic distinct-degree factorization of polynomials over finite fields.

Shuhong Gao, Erich L. Kaltofen, Alan G. B. Lauder

J. Symb. Comput., 2004

Factoring polynomials via polytopes.

Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder

Proceedings of the Symbolic and Algebraic Computation, 2004

Approximate factorization of multivariate polynomials via differential equations.

Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Random Krylov Spaces over Finite Fields.

Richard P. Brent, Shuhong Gao, Alan G. B. Lauder

SIAM J. Discret. Math., 2003

Factoring multivariate polynomials via partial differential equations.

Shuhong Gao

Math. Comput., 2003

2002

Finite Field Multiplier Using Redundant Representation.

Huapeng Wu, M. Anwarul Hasan, Ian F. Blake, Shuhong Gao

IEEE Trans. Computers, 2002

Hensel lifting and bivariate polynomial factorisation over finite fields.

Shuhong Gao, Alan G. B. Lauder

Math. Comput., 2002

2001

On the Deterministic Complexity of Factoring Polynomials.

Shuhong Gao

J. Symb. Comput., 2001

Decomposition of Polytopes and Polynomials.

Shuhong Gao, Alan G. B. Lauder

Discret. Comput. Geom., 2001

2000

Algorithms for Exponentiation in Finite Fields.

Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup

J. Symb. Comput., 2000

1999

A General Polynomial Sieve.

Shuhong Gao, Jason Howell

Des. Codes Cryptogr., 1999

1998

Gauss periods: orders and cryptographical applications.

Shuhong Gao, Joachim von zur Gathen, Daniel Panario

Math. Comput., 1998

From Hall's Matching Theorem to Optimal Routing on Hypercubes.

Shuhong Gao, Beth Novick, Ke Qiu

J. Comb. Theory B, 1998

1995

Gauss Periods and Fast Exponentiation in Finite Fields (Extended Abstract).

Shuhong Gao, Joachim von zur Gathen, Daniel Panario

Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994

Normal and Self-dual Normal Bases from Factorization of c x^q+1 + d x^q - ax - b.

Ian F. Blake, Shuhong Gao, Ronald C. Mullin

SIAM J. Discret. Math., 1994

On orders of optimal normal basis generators.

Shuhong Gao, Scott A. Vanstone

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

1993

Cyclic near difference sets of type 1.

Wan-Di Wei, Shuhong Gao, Benfu Yang

Discret. Math., 1993

On non-Abelian group difference sets.

Shuhong Gao, Wan-Di Wei

Discret. Math., 1993

Explicit Factorization of x^{2^k} + 1 over F_p with Prime p= 3 mod 4.

Ian F. Blake, Shuhong Gao, Ronald C. Mullin

Appl. Algebra Eng. Commun. Comput., 1993

Constructive problems for irreducible polynominals over finite fields.

Ian F. Blake, Shuhong Gao, Robert J. Lambert

Proceedings of the Information Theory and Applications, Third Canadian Workshop, Rockland, Ontario, Canada, May 30, 1993

1992

Optimal Normal Bases.

Shuhong Gao, Hendrik W. Lenstra Jr.

Des. Codes Cryptogr., 1992