activity
20162022
most citedCharacterizations and constructions of n-to-1 mappings over finite fields

6 citations · 19 across the 15 of their papers we have counts for

collaborators
Showing 2019 · cs.ITShow all

6 papers · 2 filters

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

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

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.IT2019

On two-to-one mappings over finite fields

Sihem Mesnager, Longjiang Qu

Two-to-one (-to-) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent…