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 cs.ITShow all

22 papers · 1 filter

cs.IT2026

Minimum Distances of Binary Goppa Codes and Constructions with Prescribed Alternating Automorphism Groups

Tianni He, Kangquan Li, Longjiang Qu

Goppa codes are a well-known class of linear codes with important applications in cryptography. Determining the minimum distance of Goppa codes and constructing Goppa codes with pr…

cs.IT2026

A class of locally differentially -uniform power functions with Niho exponents

Haode Yan, Kangquan Li

Niho exponents have found important applications in sequence design, coding theory, and cryptography. Determining the differential spectrum of a power function with Niho exponent i…

cs.IT2025

Several new classes of self-orthogonal minimal linear codes violating the Ashikhmin-Barg condition

Wengang Jin, Kangquan Li, Longjiang Qu

Linear codes have attracted considerable attention in coding theory and cryptography due to their significant applications in secret sharing schemes, secure two-party computation,…

cs.IT2025

Constructions of binary self-orthogonal singly-even minimal linear codes violating the Aschikhmin-Barg condition with few weights

Kangquan Li, Hao Chen, Wengang Jin +1

We first establish a simple yet powerful necessary and sufficient condition for a binary linear code to be SO, leading to a complete characterization of singly-even codes in this f…

cs.IT2025

Balanced Boolean functions with few-valued Walsh spectra parameterized by

Qiancheng Zhang, Kangquan Li, Longjiang Qu

Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction…

cs.IT2022

More infinite classes of APN-like Power Functions

Longjiang Qu, Kangquan Li

In the literature, there are many APN-like functions that generalize the APN properties or are similar to APN functions, e.g. locally-APN functions, 0-APN functions or those with b…

cs.IT2022★ 1 cited

More constructions of -cycle permutations

Tailin Niu, Kangquan Li, Longjiang Qu +1

-cycle permutations with small have the advantage that their compositional inverses are efficient in terms of implementation. They can be also used in constructing Bent func…

cs.IT2022★ 1 cited

Two new families of bivariate APN functions

Marco Calderini, Kangquan Li, Irene Villa

In this work, we present two new families of quadratic APN functions. The first one (F1) is constructed via biprojective polynomials. This family includes one of the two APN famili…

cs.IT2022★ 6 cited

Characterizations and constructions of n-to-1 mappings over finite fields

Tailin Niu, Kangquan Li, Longjiang Qu +1

-to- mappings have wide applications in many areas, especially in cryptography, finite geometry, coding theory and combinatorial design. In this paper, many classes of -to…

cs.IT2021★ 1 cited

Two new infinite classes of APN functions

Kangquan Li, Yue Zhou, Chunlei Li +1

In this paper, we present two new infinite classes of APN functions over $\gf_{2^{2m}}$ and $\gf_{2^{3m}}$, respectively. The first one is with bivariate form and obtained by addin…

cs.IT2020

On two conjectures about the intersection distribution

Yubo Li, Kangquan Li, Longjiang Qu

Recently, S. Li and A. Pott\cite{LP} proposed a new concept of intersection distribution concerning the interaction between the graph $\{(x,f(x))~|~x\in\F_{q}\}$ of and the lin…

cs.IT2020★ 2 cited

A complete characterization of the APN property of a class of quadrinomials

Kangquan Li, Chunlei Li, Tor Helleseth +1

In this paper, by the Hasse-Weil bound, we determine the necessary and sufficient condition on coefficients with such that $f(x) = {x}^{3\cd…

cs.IT2020

Binary linear codes with few weights from two-to-one functions

Kangquan Li, Chunlei Li, Tor Helleseth +1

In this paper, we apply two-to-one functions over in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) general…

cs.IT2020★ 18 cited

Finding compositional inverses of permutations from the AGW criterion

Tailin Niu, Kangquan Li, Longjiang Qu +1

Permutation polynomials and their compositional inverses have wide applications in cryptography, coding theory, and combinatorial designs. Motivated by several previous results on…

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

New Constructions of Permutation Polynomials of the Form over

Kangquan Li, Longjiang Qu, Qiang Wang

Permutation polynomials over finite fields have been studied extensively recently due to their wide applications in cryptography, coding theory, communication theory, among others.…

cs.IT2016★ 14 cited

New Permutation Trinomials Constructed from Fractional Polynomials

Kangquan Li, Longjiang Qu, Chao Li +1

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many…

cs.IT2015★ 5 cited

New Classes of Permutation Binomials and Permutation Trinomials over Finite Fields

Kangquan Li, Longjiang Qu, Xi Chen

Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and engineering such as coding th…