activity
20152026
most citedFinding compositional inverses of permutations from the AGW criterion

18 citations · 67 across the 25 of their papers we have counts for

collaborators
Showing 2019Show all

6 papers · 1 filter

cs.IT2019★ 3 cited

Cryptographically Strong Permutations from the Butterfly Structure

Kangquan Li, Chunlei Li, Tor Helleseth +1

In this paper, we present infinite families of permutations of with high nonlinearity and boomerang uniformity from generalized butterfly structures. Both…

cs.IT2019★ 3 cited

Further study of -to- mappings over

Kangquan Li, Sihem Mesnager, Longjiang Qu

-to- mappings over finite fields play an important role in symmetric cryptography, in particular in the constructions of APN functions, bent functions, semi-bent functions an…

cs.IT2019★ 3 cited

On a conjecture about a class of permutation quadrinomials

Kangquan Li, Longjiang Qu, Chao Li +1

Very recently, Tu et al. presented a sufficient condition about , see Theorem 1.1, such that is…

cs.IT2019★ 7 cited

On the Differential-Linear Connectivity Table of Vectorial Boolean Functions

Anne Canteaut, Lukas Kölsch, Chao Li +4

Vectorial Boolean functions are crucial building-blocks in symmetric ciphers. Different known attacks on block ciphers have resulted in diverse cryptographic criteria for vectorial…

cs.IT2019★ 2 cited

On the Differential Linear Connectivity Table of Vectorial Boolean Functions

Kangquan Li, Chunlei Li, Chao Li +1

Vectorial Boolean functions are crucial building blocks in symmetric ciphers. Different known attacks on block ciphers have resulted in diverse cryptographic criteria of vectorial…

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…