The following pages link to Shuhong Gao (Q165900):
Displayed 50 items.
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- Specific irreducible polynomials with linearly independent roots over finite fields (Q677139) (← links)
- Solving the 100 swiss francs problem (Q691647) (← links)
- Linked graphs with restricted lengths (Q933678) (← links)
- Finite field elements of high order arising from modular curves (Q1009164) (← links)
- Short containers in Cayley graphs (Q1028103) (← links)
- Optimal normal bases (Q1203948) (← links)
- On non-Abelian group difference sets (Q1210555) (← links)
- Density of normal elements (Q1266417) (← links)
- Cyclic near difference sets of type 1 (Q1313977) (← links)
- Dickson polynomials and irreducible polynomials over finite fields (Q1336063) (← links)
- Irreducibility of polynomials modulo \(p\) via Newton polytopes. (Q1399670) (← links)
- From Hall's matching theorem to optimal routing on hypercubes (Q1569034) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- A general polynomial sieve. (Q1591638) (← links)
- Multivariate public key cryptosystems from Diophantine equations (Q1936497) (← links)
- Extracting sparse factors from multivariate integral polynomials (Q1940925) (← links)
- Characteristic polynomials of the curve \(v^2=u^p-au-b\) over finite fields of characteristic \(p\) (Q1946683) (← links)
- Codes for distributed storage from 3-regular graphs (Q2012057) (← links)
- The complexity of subdivision for diameter-distance tests (Q2188972) (← links)
- Sparse univariate polynomials with many roots over finite fields (Q2363328) (← links)
- Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\) (Q2366272) (← links)
- Fault tolerance of Cayley graphs (Q2385101) (← links)
- The optimal linear secret sharing scheme for any given access structure (Q2440328) (← links)
- Error analysis of weak poly-LWE instances (Q2632837) (← links)
- Deterministic distinct-degree factorization of polynomials over finite fields (Q2643572) (← links)
- (Q2712100) (← links)
- (Q2824540) (← links)
- A new incremental algorithm for computing Groebner bases (Q2946515) (← links)
- Primary decomposition of zero-dimensional ideals over finite fields (Q3055105) (← links)
- Hensel lifting and bivariate polynomial factorisation over finite fields (Q3147180) (← links)
- A New Algorithm for Decoding Reed-Solomon Codes (Q3448743) (← links)
- A new framework for computing Gröbner bases (Q3450045) (← links)
- On Disjoint Shortest Paths Routing on the Hypercube (Q3637084) (← links)
- (Q3972107) (← links)
- (Q3972870) (← links)
- (Q4217863) (← links)
- (Q4217866) (← links)
- (Q4226694) (← links)
- Elements of provable high orders in finite fields (Q4235576) (← links)
- Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$ (Q4307056) (← links)
- (Q4314359) (← links)
- (Q4336113) (← links)
- (Q4349310) (← links)
- Gauss periods: orders and cryptographical applications (Q4372701) (← links)
- (Q4382304) (← links)
- Random Krylov Spaces over Finite Fields (Q4443084) (← links)
- (Q4495303) (← links)
- Fast Decoding of Expander Codes (Q4566680) (← links)
- Finite field multiplier using redundant representation (Q4571246) (← links)