Search Results - "LONGJIANG QU"

New Results About the Boomerang Uniformity of Permutation Polynomials by Li, Kangquan, Qu, Longjiang, Sun, Bing, Li, Chao

“…In EUROCRYPT 2018, Cid et al. introduced a new concept on the cryptographic property of S-boxes: boomerang connectivity table (BCT for short) for evaluating…”
Get full text

A New Approach to Constructing Quadratic Pseudo-Planar Functions Over by Qu, Longjiang

“…Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like iterated ciphers,…”
Get full text

New classes of permutation binomials and permutation trinomials over finite fields by Li, Kangquan, Qu, Longjiang, Chen, Xi

“…Permutation polynomials over finite fields play important roles in finite fields theory. They also have wide applications in many areas of science and…”
Get full text

Cryptographically strong permutations from the butterfly structure by Li, Kangquan, Li, Chunlei, Helleseth, Tor, Qu, Longjiang

“…Boomerang connectivity table is a new tool to characterize the vulnerability of cryptographic functions against boomerang attacks. Consequently, a…”
Get full text

Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity by Qu, Longjiang, Feng, Keqin, Liu, Feng, Wang, Lei

“…Symmetric Boolean functions with even variables 2k and maximum algebraic immunity AI (f) = k have been constructed in Braeken's thesis (2006). In this paper,…”
Get full text

A New Method to Compute the 2-Adic Complexity of Binary Sequences by Xiong, Hai, Qu, Longjiang, Li, Chao

“…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…”
Get full text

On two conjectures about the intersection distribution by Li, Yubo, Li, Kangquan, Qu, Longjiang

“…Recently, Li and Pott proposed a new concept of intersection distribution concerning the interaction between the graph { ( x , f ( x ) ) | x ∈ F q } of f and…”
Get full text

Constructions of 2-resilient rotation symmetric Boolean functions through symbol transformations of cyclic Hadamard matrix by Du, Jiao, Chen, Ziyu, Fu, Shaojing, Qu, Longjiang, Li, Chao

“…In this paper, the properties of symbol transformations of cyclic Hadamard matrices are studied. An infinite class of (n−1)-variable 2-resilient rotation…”
Get full text

A New Random Sampling Method and Its Application in Improving Progressive BKZ Algorithm by Sun, Minghao, Wang, Shixiong, Chen, Hao, Qu, Longjiang

“…Random sampling algorithm was proposed firstly by Schnorr in 2003 to find short lattice vectors, as an alternative to enumeration. The follow-up developments…”
Get full text

Constructing Differentially 4-Uniform Permutations Over F22k via the Switching Method by LONGJIANG QU, YIN TAN, CHIK HOW TAN, CHAO LI

Get full text

On the Construction of Boolean Functions With Optimal Algebraic Immunity by Li, Na, Qu, LongJiang, Qi, Wen-Feng, Feng, GuoZhu, Li, Chao, Xie, DuanQiang

“…In this correspondence, we introduce a method to construct Boolean functions in any number of variables, with optimal algebraic immunity. Remarkably, all…”
Get full text

Differential and boomerang spectrums of some power permutations by Jiang, Sha, Li, Kangquan, Li, Yubo, Qu, Longjiang

“…The differential (resp. boomerang) spectrum is an important parameter to estimate the resistance of cryptographic functions against some variants of…”
Get full text

Minimal linear codes from weakly regular bent functions by Xu, Guangkui, Qu, Longjiang, Luo, Gaojun

“…Minimal linear codes have received much attention in the past decades due to their important applications in secret sharing schemes and secure two-party…”
Get full text

New constructions of involutions over finite fields by Niu, Tailin, Li, Kangquan, Qu, Longjiang, Wang, Qiang

“…Involutions over finite fields are permutations whose compositional inverses are themselves. Involutions especially over F q with q is even have been used in…”
Get full text

A new algorithm on the minimal rational fraction representation of feedback with carry shift registers by Li, Yubo, Yang, Zhichao, Li, Kangquan, Qu, Longjiang

“…In 1994, Klapper and Goresky (Proceedings of the 1993 Cambridge Security Workshop, Lecture Notes in Computer Science, vol 809, Cambridge, pp 174–178, 1994 )…”
Get full text

More permutations and involutions for constructing bent functions by Li, Yubo, Li, Kangquan, Mesnager, Sihem, Qu, Longjiang

“…Bent functions are extremal combinatorial objects with several applications, such as coding theory, maximum length sequences, cryptography, the theory of…”
Get full text

Vulnerable Public Keys in NTRU Cryptosystem by Xu, Liqing, Chen, Hao, Li, Chao, Qu, Longjiang

“…In this paper the authors give an efficient bounded distance decoding (BDD for short) algorithm for NTRU lattices under some conditions about the modulus…”
Get full text

A New Automatic Tool Searching for Impossible Differential of NIST Candidate ACE by Liu, Jingyi, Liu, Guoqiang, Qu, Longjiang

“…The ACE algorithm is a candidate of the Lightweight Cryptography standardization process started by the National Institute of Standards and Technology (NIST)…”
Get full text

On the Covering Structures of Two Classes of Linear Codes From Perfect Nonlinear Functions by Li, C, Ling, S, Qu, L

“…In this paper, the weight distributions of two classes of linear codes based on all known explicit perfect nonlinear functions from Fqm to itself are…”
Get full text

Compositional inverses of permutation polynomials of the form xrh(xs) over finite fields by Li, Kangquan, Qu, Longjiang, Wang, Qiang

“…The study of computing compositional inverses of permutation polynomials over finite fields efficiently is motivated by an open problem proposed by G. L…”
Get full text