18 citations · 67 across the 25 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CR2013
A New Method to Compute the 2-adic Complexity of Binary Sequences
Hai Xiong, Longjiang Qu, Chao Li
In this paper, a new method is presented to compute the 2-adic complexity of pseudo-random sequences. With this method, the 2-adic complexities of all the known sequences with idea…
cs.IT2013
More Constructions of Differentially 4-uniform Permutations on $\gf_{2^{2k}}$
Longjiang Qu, Yin Tan, Chao Li +1
Differentially 4-uniform permutations on $\gf_{2^{2k}}$ with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduc…