Pseudorandom Generators Based on Subcovers for Finite Groups. - Chenggen Song; Maozhi Xu; Chunming Tang 001 (Inscrypt, 2011)

A new class of hyper-bent Boolean functions in binomial forms - Baocheng Wang; Chunming Tang 001; Yanfeng Qi; Yixian Yang; Maozhi Xu (CoRR, 2011)

A generalization of the class of hyper-bent Boolean functions in binomial forms. - Baocheng Wang; Chunming Tang 001; Yanfeng Qi; Yixian Yang (IACR Cryptol. ePrint Arch., 2011)

A New Class of Hyper-bent Boolean Functions with Multiple Trace Terms. - Baocheng Wang; Chunming Tang 001; Yanfeng Qi; Yixian Yang; Maozhi Xu (IACR Cryptol. ePrint Arch., 2011)

Faster pairing computation on genus 2 hyperelliptic curves. - Chunming Tang 001; Maozhi Xu; Yanfeng Qi (Inf. Process. Lett., 2011)

A Note on Weight Distributions of Irreducible Cyclic Codes - Baocheng Wang; Chunming Tang 001; Yanfeng Qi; Yixian Yang; Maozhi Xu (CoRR, 2012)

Constructing Vectorial Boolean Functions with High Algebraic Immunity Based on Group Decomposition. - Yu Lou 001; Huiting Han; Chunming Tang 001; Maozhi Xu (IACR Cryptol. ePrint Arch., 2012)

The Weight Distributions of Cyclic Codes and Elliptic Curves. - Baocheng Wang; Chunming Tang 001; Yanfeng Qi; Yixian Yang; Maozhi Xu (IEEE Trans. Inf. Theory, 2012)

A Note on Semi-bent and Hyper-bent Boolean Functions. - Chunming Tang 001; Yu Lou 001; Yanfeng Qi; Maozhi Xu; Baoan Guo (Inscrypt, 2013)

An Attribute-Based Encryption Scheme with Constant-Size Ciphertexts. - Yanfeng Qi; Chunming Tang 001; Yu Lou 001; Maozhi Xu; Baoan Guo (GreenCom/iThings/CPScom, 2013)

Effective Construction of a Class of Bent Quadratic Boolean Functions. - Chunming Tang 001; Yanfeng Qi (CoRR, 2013)

A new class of semi-bent quadratic Boolean functions. - Chunming Tang 001; Yanfeng Qi (IACR Cryptol. ePrint Arch., 2013)

A new class of hyper-bent functions and Kloosterman sums. - Chunming Tang 001; Yanfeng Qi (IACR Cryptol. ePrint Arch., 2013)

New Quadratic Bent Functions in Polynomial Forms with Coefficients in Extension Fields. - Chunming Tang 001; Yanfeng Qi; Maozhi Xu (IACR Cryptol. ePrint Arch., 2013)

A note on cyclic codes from APN functions. - Chunming Tang 001; Yanfeng Qi; Maozhi Xu (Appl. Algebra Eng. Commun. Comput., 2014)

Implementing optimized pairings with elliptic nets. - Chunming Tang 001; Dongmei Ni; Maozhi Xu; Baoan Guo; Yanfeng Qi (Sci. China Inf. Sci., 2014)

Constructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice. - Chunming Tang 001; Yanfeng Qi (IACR Cryptol. ePrint Arch., 2014)

Privacy-Preserving Face Recognition with Outsourced Computation. - Can Xiang; Chunming Tang 001 (IACR Cryptol. ePrint Arch., 2014)

Cryptography on twisted Edwards curves over local fields. - Chunming Tang 001; Maozhi Xu; Yanfeng Qi (Sci. China Inf. Sci., 2015)

New infinite families of p-ary weakly regular bent functions. - Yanfeng Qi; Chunming Tang 001; Zhengchun Zhou; Cuiling Fan (CoRR, 2015)

Two-weight and three-weight linear codes from weakly regular bent functions. - Chunming Tang 001; Yanfeng Qi (CoRR, 2015)

Constructing bent functions and bent idempotents of any possible algebraic degrees. - Chunming Tang 001; Yanfeng Qi; Zhengchun Zhou; Cuiling Fan (CoRR, 2015)

A Construction of Linear Codes over $ f_{2^t}$ from Boolean Functions. - Can Xiang; Keqin Feng; Chunming Tang 001 (CoRR, 2015)

Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition. - Yu Lou 001; Huiting Han; Chunming Tang 001; Zhangqing Wu; Maozhi Xu (Int. J. Comput. Math., 2015)

Securely verifiable outsourcing schemes of matrix calculation. - Can Xiang; Chunming Tang 001 (Int. J. High Perform. Comput. Netw., 2015)

Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server. - Can Xiang; Chunming Tang 001 (J. Ambient Intell. Humaniz. Comput., 2015)

Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields. - Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (CoRR, 2016)

Special values of Kloosterman sums and binomial bent functions. - Chunming Tang 001; Yanfeng Qi (Finite Fields Their Appl., 2016)

Construction of Efficient MDS Matrices Based on Block Circulant Matrices for Lightweight Application. - Huiting Han; Chunming Tang 001; Yu Lou 001; Maozhi Xu (Fundam. Informaticae, 2016)

Complete characterization of generalized bent and 2^k-bent Boolean functions. - Chunming Tang 001; Can Xiang; Yanfeng Qi; Keqin Feng (IACR Cryptol. ePrint Arch., 2016)

Binary Linear Codes With Few Weights. - Yanfeng Qi; Chunming Tang 001; Dongmei Huang (IEEE Commun. Lett., 2016)

Two-Weight and Three-Weight Linear Codes From Square Functions. - Chunming Tang 001; Yanfeng Qi; Dongmei Huang (IEEE Commun. Lett., 2016)

New verifiable outsourced computation scheme for an arbitrary function. - Can Xiang; Chunming Tang 001 (Int. J. Grid Util. Comput., 2016)

Privacy-preserving face recognition with outsourced computation. - Can Xiang; Chunming Tang 001; Yunlu Cai; Qiuxia Xu (Soft Comput., 2016)

Linear Codes With Two or Three Weights From Weakly Regular Bent Functions. - Chunming Tang 001; Nian Li; Yanfeng Qi; Zhengchun Zhou; Tor Helleseth (IEEE Trans. Inf. Theory, 2016)

A class of hyper-bent functions and Kloosterman sums. - Chunming Tang 001; Yanfeng Qi (Cryptogr. Commun., 2017)

A class of linear codes with a few weights. - Can Xiang; Chunming Tang 001; Keqin Feng (Cryptogr. Commun., 2017)

Linear codes over Fq which are equivalent to LCD codes. - Claude Carlet; Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (CoRR, 2017)

On σ-LCD codes. - Claude Carlet; Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (CoRR, 2017)

Linear codes with few weights from inhomogeneous quadratic functions. - Chunming Tang 001; Can Xiang; Keqin Feng (Des. Codes Cryptogr., 2017)

Generalized Plateaued Functions and Admissible (Plateaued) Functions. - Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (IEEE Trans. Inf. Theory, 2017)

Complete Characterization of Generalized Bent and 2k-Bent Boolean Functions. - Chunming Tang 001; Can Xiang; Yanfeng Qi; Keqin Feng (IEEE Trans. Inf. Theory, 2017)

Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees. - Chunming Tang 001; Zhengchun Zhou; Yanfeng Qi; Xiaosong Zhang 001; Cuiling Fan; Tor Helleseth (IEEE Trans. Inf. Theory, 2017)

A Construction of Linear Codes Over 𝔽2t From Boolean Functions. - Can Xiang; Keqin Feng; Chunming Tang 001 (IEEE Trans. Inf. Theory, 2017)

Explicit characterization of two classes of regular bent functions. - Yanfeng Qi; Chunming Tang 001; Dongmei Huang (Appl. Algebra Eng. Commun. Comput., 2018)

Two infinite classes of rotation symmetric bent functions with simple representation. - Chunming Tang 001; Yanfeng Qi; Zhengchun Zhou; Cuiling Fan (Appl. Algebra Eng. Commun. Comput., 2018)

Two classes of linear codes and their weight distributions. - Can Xiang; Xianfang Wang; Chunming Tang 001; Fang-Wei Fu 001 (Appl. Algebra Eng. Commun. Comput., 2018)

Several infinite families of p-ary weakly regular bent functions. - Yanfeng Qi; Chunming Tang 001; Zhengchun Zhou; Cuiling Fan (Adv. Math. Commun., 2018)

Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences. - Cunsheng Ding; Sihem Mesnager; Chunming Tang 001; Maosheng Xiong (CoRR, 2018)

Euclidean and Hermitian LCD MDS codes. - Claude Carlet; Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (Des. Codes Cryptogr., 2018)

On the Menezes-Teske-Weng's conjecture. - Sihem Mesnager; Kwang Ho Kim; Junyop Choe; Chunming Tang 001 (IACR Cryptol. ePrint Arch., 2018)

Linear Codes Over 𝔽q Are Equivalent to LCD Codes for q>3. - Claude Carlet; Sihem Mesnager; Chunming Tang 001; Yanfeng Qi; Ruud Pellikaan (IEEE Trans. Inf. Theory, 2018)

Complementary Dual Algebraic Geometry Codes. - Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (IEEE Trans. Inf. Theory, 2018)

2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions. - Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (IEEE Trans. Inf. Theory, 2018)

Further Results on Generalized Bent Functions and Their Complete Characterization. - Sihem Mesnager; Chunming Tang 001; Yanfeng Qi; Libo Wang; Baofeng Wu; Keqin Feng (IEEE Trans. Inf. Theory, 2018)

New quadratic bent functions in polynomial forms with coefficients in extension fields. - Dongmei Huang; Chunming Tang 001; Yanfeng Qi; Maozhi Xu (Appl. Algebra Eng. Commun. Comput., 2019)

Some classes of LCD codes and self-orthogonal codes over finite fields. - Xia Li; Feng Cheng; Chunming Tang 001; Zhengchun Zhou (Adv. Math. Commun., 2019)

Regular p-ary bent functions with five terms and Kloosterman sums. - Chunming Tang 001; Yanfeng Qi; Dongmei Huang (Cryptogr. Commun., 2019)

Steiner systems S(2, 4, 3m-1/2) and 2-designs from ternary linear codes of length 3m-1/2. - Chunming Tang 001; Cunsheng Ding; Maosheng Xiong (CoRR, 2019)

On the boomerang uniformity of (quadratic) permutations over F2n. - Sihem Mesnager; Chunming Tang 001; Maosheng Xiong (CoRR, 2019)

A class of narrow-sense BCH codes over Fq of length (qm-1)/2. - Xin Ling; Sihem Mesnager; Yanfeng Qi; Chunming Tang 001 (CoRR, 2019)

Codebooks from generalized bent Z4-valued quadratic forms. - Yanfeng Qi; Sihem Mesnager; Chunming Tang 001 (CoRR, 2019)

Codes, differentially δ-uniform functions and t-designs. - Chunming Tang 001; Cunsheng Ding; Maosheng Xiong (CoRR, 2019)

Further study on the maximum number of bent components of vectorial functions. - Sihem Mesnager; Fengrong Zhang; Chunming Tang 001; Yong Zhou 003 (Des. Codes Cryptogr., 2019)

Steiner systems $$S(2, 4, frac{3^m-1}{2})$$ and 2-designs from ternary linear codes of length $$ frac{3^m-1}{2}$$. - Chunming Tang 001; Cunsheng Ding; Maosheng Xiong (Des. Codes Cryptogr., 2019)

On the boomerang uniformity of quadratic permutations over 픽2n. - Sihem Mesnager; Chunming Tang 001; Maosheng Xiong (IACR Cryptol. ePrint Arch., 2019)

New Characterization and Parametrization of LCD Codes. - Claude Carlet; Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (IEEE Trans. Inf. Theory, 2019)

On $ sigma$ -LCD Codes. - Claude Carlet; Sihem Mesnager; Chunming Tang 001; Yanfeng Qi (IEEE Trans. Inf. Theory, 2019)

Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction. - Zhengchun Zhou; Xia Li; Chunming Tang 001; Cunsheng Ding (IEEE Trans. Inf. Theory, 2019)

Combinatorial t-designs from special functions. - Cunsheng Ding; Chunming Tang 001 (Cryptogr. Commun., 2020)

On the Menezes-Teske-Weng conjecture. - Sihem Mesnager; Kwang Ho Kim; Junyop Choe; Chunming Tang 001 (Cryptogr. Commun., 2020)

The Projective General Linear Group PGL2(GF(2sm)) and Linear Codes of Length 2m+1. - Cunsheng Ding; Chunming Tang 001; Vladimir D. Tonchev (CoRR, 2020)

Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes. - Cunsheng Ding; Chunming Tang 001; Vladimir D. Tonchev (Des. Codes Cryptogr., 2020)

A class of narrow-sense BCH codes over $ mathbb {F}_q$ of length $ frac{q^m-1}{2}$. - Xin Ling; Sihem Mesnager; Yanfeng Qi; Chunming Tang 001 (Des. Codes Cryptogr., 2020)

On the boomerang uniformity of quadratic permutations. - Sihem Mesnager; Chunming Tang 001; Maosheng Xiong (Des. Codes Cryptogr., 2020)

New characterizations and construction methods of bent and hyper-bent Boolean functions. - Sihem Mesnager; Bimal Mandal; Chunming Tang 001 (Discret. Math., 2020)

Codebooks from generalized bent Z4-valued quadratic forms. - Yanfeng Qi; Sihem Mesnager; Chunming Tang 001 (Discret. Math., 2020)

Infinite Families of Near MDS Codes Holding t-Designs. - Cunsheng Ding; Chunming Tang 001 (IEEE Trans. Inf. Theory, 2020)

Minimal Linear Codes From Characteristic Functions. - Sihem Mesnager; Yanfeng Qi; Hongming Ru; Chunming Tang 001 (IEEE Trans. Inf. Theory, 2020)

Codes, Differentially $ delta$ -Uniform Functions, and $t$ -Designs. - Chunming Tang 001; Cunsheng Ding; Maosheng Xiong (IEEE Trans. Inf. Theory, 2020)

Infinite families of 3-designs from o-polynomials. - Cunsheng Ding; Chunming Tang 001 (Adv. Math. Commun., 2021)

A construction of p-ary linear codes with two or three weights. - Hongming Ru; Chunming Tang 001; Yanfeng Qi; Yuxiao Deng (Adv. Math. Commun., 2021)

A new class of p-ary regular bent functions. - Chunming Tang 001; Maozhi Xu; Yanfeng Qi; Mingshuo Zhou (Adv. Math. Commun., 2021)

The linear codes of t-designs held in the Reed-Muller and Simplex codes. - Cunsheng Ding; Chunming Tang 001 (Cryptogr. Commun., 2021)

An Open Problem on the Bentness of Mesnager's Functions. - Chunming Tang 001; Peng Han; Qi Wang 012; Jun Zhang 031; Yanfeng Qi (CoRR, 2021)

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). - Can Xiang; Chunming Tang 001; Qi Liu (CoRR, 2021)

The projective general linear group ${ mathrm {PGL}}(2, 2^m)$ and linear codes of length 2m+1. - Cunsheng Ding; Chunming Tang 001; Vladimir D. Tonchev (Des. Codes Cryptogr., 2021)

An Open Problem on the Bentness of Mesnagerâs Functions. - Chunming Tang 001; Peng Han; Qi Wang 012; Jun Zhang 031; Yanfeng Qi (IACR Cryptol. ePrint Arch., 2021)

Cyclic Bent Functions and Their Applications in Sequences. - Kanat S. Abdukhalikov; Cunsheng Ding; Sihem Mesnager; Chunming Tang 001; Maosheng Xiong (IEEE Trans. Inf. Theory, 2021)

A Novel Application of Boolean Functions With High Algebraic Immunity in Minimal Codes. - Hang Chen; Cunsheng Ding; Sihem Mesnager; Chunming Tang 001 (IEEE Trans. Inf. Theory, 2021)

Shortened Linear Codes Over Finite Fields. - Yang Liu; Cunsheng Ding; Chunming Tang 001 (IEEE Trans. Inf. Theory, 2021)

Fast Algebraic Immunity of Boolean Functions and LCD Codes. - Sihem Mesnager; Chunming Tang 001 (IEEE Trans. Inf. Theory, 2021)

An Infinite Family of Linear Codes Supporting 4-Designs. - Chunming Tang 001; Cunsheng Ding (IEEE Trans. Inf. Theory, 2021)

Full Characterization of Minimal Linear Codes as Cutting Blocking Sets. - Chunming Tang 001; Yan Qiu; Qunying Liao; Zhengchun Zhou (IEEE Trans. Inf. Theory, 2021)

The Projective General Linear Group PGL(2, 5m) and Linear Codes of Length 5m+1. - Yue Zhao; Chunming Tang 001; Yanfeng Qi (WAIFI, 2022)

Infinite families of 2-designs from linear codes. - Xiaoni Du; Rong Wang; Chunming Tang 001; Qi Wang 012 (Appl. Algebra Eng. Commun. Comput., 2022)

Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields. - Claude Carlet; Peng Han; Sihem Mesnager; Chunming Tang 001 (Adv. Math. Commun., 2022)

Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. - Xiaoni Du; Rong Wang; Chunming Tang 001; Qi Wang 012 (Adv. Math. Commun., 2022)

Preface. - Sihem Mesnager; Xiaohu Tang; Zhengchun Zhou; Chunming Tang 001; Qi Wang 012 (Adv. Math. Commun., 2022)

Some shortened codes from linear codes constructed by defining sets. - Can Xiang; Chunming Tang 001; Min Guo (Adv. Math. Commun., 2022)

An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). - Can Xiang; Chunming Tang 001; Qi Liu (Des. Codes Cryptogr., 2022)

A class of twisted generalized Reed-Solomon codes. - Jun Zhang 031; Zhengchun Zhou; Chunming Tang 001 (Des. Codes Cryptogr., 2022)

On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences. - Qi Liu; Cunsheng Ding; Sihem Mesnager; Chunming Tang 001; Vladimir D. Tonchev (IEEE Trans. Inf. Theory, 2022)

Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances. - Chunming Tang 001; Cunsheng Ding (IEEE Trans. Inf. Theory, 2022)

The Subfield Codes and Subfield Subcodes of a Family of MDS Codes. - Chunming Tang 001; Qi Wang 012; Cunsheng Ding (IEEE Trans. Inf. Theory, 2022)

Shortened Linear Codes From APN and PN Functions. - Can Xiang; Chunming Tang 001; Cunsheng Ding (IEEE Trans. Inf. Theory, 2022)

Codes and Pseudo-Geometric Designs from the Ternary m-Sequences with Welch-type decimation d=2·3(n-1)/2+1. - Can Xiang; Chunming Tang 001; Haode Yan; Min Guo (CoRR, 2023)

The minimum locality of linear codes. - Pan Tan; Cuiling Fan; Cunsheng Ding; Chunming Tang 001; Zhengchun Zhou (Des. Codes Cryptogr., 2023)

Some 3-designs and shortened codes from binary cyclic codes with three zeros. - Can Xiang; Chunming Tang 001 (Finite Fields Their Appl., 2023)

Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs. - Xiaoqiang Wang 001; Chunming Tang 001; Cunsheng Ding (IEEE Trans. Inf. Theory, 2023)

The solution to an open problem on the bentness of Mesnager's functions. - Chunming Tang 001; Peng Han; Qi Wang 012; Jun Zhang 031; Yanfeng Qi (Finite Fields Their Appl., 2023)

Codes and pseudo-geometric designs from the ternary m-sequences with Welch-type decimation d = 2 ⋅ 3(n-1)/2 + 1. - Can Xiang; Chunming Tang 001; Haode Yan; Min Guo (Finite Fields Their Appl., 2024)

Large Sets of Binary Spreading Sequences With Low Correlation and Low PAPR via Gold Functions. - Kaiqiang Liu; Zhengchun Zhou; Avik Ranjan Adhikary; Chunming Tang 001 (IEEE Trans. Inf. Theory, 2024)

Three new classes of spreading sequence sets with low correlation and PAPR. - Can Xiang; Chunming Tang 001; Wenwei Qiu (Finite Fields Their Appl., 2025)

Derivative descendants of cyclic codes and constacyclic codes. - Li Xu; Cuiling Fan; Chunming Tang 001; Zhengchun Zhou (Des. Codes Cryptogr., 2025)