18 citations · 67 across the 25 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2019★ 1 cited
New Results about the Boomerang Uniformity of Permutation Polynomials
Kangquan Li, Longjiang Qu, Bing Sun +1
In EUROCRYPT 2018, Cid et al. \cite{BCT2018} introduced a new concept on the cryptographic property of S-boxes: Boomerang Connectivity Table (BCT for short) for evaluating the subt…
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…