#### Filter Results:

- Full text PDF available (24)

#### Publication Year

2005

2017

- This year (6)
- Last 5 years (31)
- Last 10 years (37)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Yunhua Ma, Xiufeng Wang, Min Wei, Yanfeng Qi, Tianlai Li
- Ying yong sheng tai xue bao = The journal of…
- 2005

The study showed that in solar greenhouse continuously cropped cucumber soil, phenolic acids p-hydroxybenzoic acid, ferulic acid and benzoic acid had an obvious accumulation with increasing cropping year, and their contents were significantly higher after continuously cropped for 5 approximately 9 years than for 1 approximately 3 years. With the increasing… (More)

- Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi
- ArXiv
- 2017

Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. On the… (More)

- Chunming Tang, Nian Li, Yanfeng Qi, Zhengchun Zhou, Tor Helleseth
- IEEE Transactions on Information Theory
- 2016

Linear codes with a few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of constructing two-weight and three-weight linear codes of Ding et al. and Zhou et al. to general weakly regular bent… (More)

- Sihem Mesnager, Chunming Tang, Yanfeng Qi
- ArXiv
- 2016

Linear complementary dual (LCD) codes is a class of linear codes introduced by Massey in 1964. LCD codes have been extensively studied in literature recently. In addition to their applications in data storage, communications systems, and consumer electronics, LCD codes have been employed in cryptography recently. More specifically, an application of LCD… (More)

- Chunming Tang, Yanfeng Qi
- IACR Cryptology ePrint Archive
- 2013

In this paper, we present a new class of semi-bent quadratic Boolean functions of the form f (x) = ∑ ⌊ m−1 2 ⌋ i=1 T r n 1 (c i x 1+4 i) (c i ∈ F 4 ,n = 2m). We first characterize the semi-bentness of these quadratic Boolean functions. There exists semi-bent functions only when m is odd. For the case: m = p r , where p is an odd prime with some conditions,… (More)

- Chunming Tang, Yanfeng Qi
- ArXiv
- 2013

In this paper, we consider the characterization of the bentness of quadratic Boolean functions of the form f (x) = m 2 −1 i=1 T r n 1 (c i x 1+2 ei)+T r n/2 1 (c m/2 x 1+2 n/2), where n = me, m is even and c i ∈ GF (2 e). For a general m, it is difficult to determine the bentness of these functions. We present the bentness of quadratic Boolean function for… (More)

- Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu
- IEEE Transactions on Information Theory
- 2012

Cyclic codes with two zeros and their dual codes as a practically and theoretically interesting class of linear codes have been studied for many years and find many applications. The determination of the weight distributions of such codes is an open problem. Generally, the weight distributions of cyclic codes are difficult to determine. Utilizing a class of… (More)

- Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu
- ArXiv
- 2011

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals 2 n−1 ± 2 n 2 −1 , were introduced by Rothaus in 1976 when he considered problems in combinatorics. Bent functions have been extensively studied due to their applications in cryptography, such as… (More)

- Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu
- IACR Cryptology ePrint Archive
- 2010

—Introduced by Rothaus in 1976 as interesting combi-natorial objects, bent functions are maximally nonlinear Boolean functions with even numbers of variables whose Hamming distance to the set of all affine functions equals 2 n−1 ± 2 n 2 −1. Not only bent functions are applied in cryptography, such as applications in components of S-box, block cipher and… (More)

- Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang
- IACR Cryptology ePrint Archive
- 2011

Bent functions, which are maximally nonlinear Boolean functions with even numbers of variables and whose Hamming distance to the set of all affine functions equals 2 n−1 ± 2 n 2 −1 , were introduced by Rothaus in 1976 when he considered problems in combinatorics. Bent functions have been extensively studied due to their applications in cryptography, such as… (More)