Yuhua Sun

activity

20102025

most citedHeat flow method to Lichnerowicz type equation on closed manifolds

6 citations · 14 across the 22 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

cs.IT2017

A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^{n}$

Yuhua Sun, Qiang Wang, Tongjiang Yan +1

Let $p$ be an odd prime, $n$ a positive integer and $g$ a primitive root of $p^{n}$ . Suppose $D_{i}^{(p^{n})} = {g^{2 s + i} ∣ s = 0, 1, 2, \dots, \frac{( p - 1 ) p ^{n - 1}}{2}}$ , $i = 0, 1$ , is the general…

cs.IT2017★ 1 cited

A lower bound on the 2-adic complexity of modified Jacobi sequence

Yuhua Sun, Qiang Wang, Tongjiang Yan

Let $p, q$ be distinct primes satisfying $gcd (p - 1, q - 1) = d$ and let $D_{i}$ , $i = 0, 1, \dots, d - 1$ , be Whiteman's generalized cyclotomic classes with $Z_{pq}^{\ast}=\cup_{i=0}^{d-…

cs.IT2017★ 1 cited

Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of $p$ -ary $m$ -Sequence

Yuhua Sun, Qiuyan Wang, Tongjiang Yan +1

LSB (Least Significant Bit) sequences are widely used as the initial inputs in some modern stream ciphers, such as the ZUC algorithm-the core of the 3GPP LTE International Encrypti…

cs.IT2017

The 2-adic complexity of a class of binary sequences with almost optimal autocorrelation

Yuhua Sun, Qiang Wang, Tongjiang Yan

Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and large 2-adic complexity, have been applied in stream cipher. In gene…

A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period pn

A lower bound on the 2-adic complexity of modified Jacobi sequence

Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of p-ary m-Sequence

The 2-adic complexity of a class of binary sequences with almost optimal autocorrelation

A lower bound on the 2-adic complexity of Ding-Helleseth generalized cyclotomic sequences of period $p^{n}$

Autocorrelation and Lower Bound on the 2-Adic Complexity of LSB Sequence of $p$ -ary $m$ -Sequence