default search action
Chunming Tang 0001
Person information
- affiliation: China West Normal University, Nanchong, China
Other persons with the same name
- Chunming Tang (aka: Chun-Ming Tang) — disambiguation page
- Chunming Tang 0002
(aka: Chun-Ming Tang 0002) — Guangxi University, Nanning, China
- Chunming Tang 0003
- Chunming Tang 0004 (aka: Chun-Ming Tang 0004) — University of Florida, Gainesville, FL, USA
- Chunming Tang 0005 — Peking University, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j77]Can Xiang, Chunming Tang
Codes and pseudo-geometric designs from the ternary m-sequences with Welch-type decimation d = 2 ⋅ 3(n-1)/2 + 1. Finite Fields Their Appl. 94: 102341 (2024) - [j76]Kaiqiang Liu, Zhengchun Zhou
Large Sets of Binary Spreading Sequences With Low Correlation and Low PAPR via Gold Functions. IEEE Trans. Inf. Theory 70(7): 5309-5322 (2024) - 2023
- [j75]Pan Tan, Cuiling Fan
The minimum locality of linear codes. Des. Codes Cryptogr. 91(1): 83-114 (2023) - [j74]Chunming Tang
The solution to an open problem on the bentness of Mesnager's functions. Finite Fields Their Appl. 88: 102170 (2023) - [j73]Can Xiang, Chunming Tang
Some 3-designs and shortened codes from binary cyclic codes with three zeros. Finite Fields Their Appl. 89: 102201 (2023) - [j72]Xiaoqiang Wang
Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs. IEEE Trans. Inf. Theory 69(4): 2341-2354 (2023) - [i59]Can Xiang, Chunming Tang, Haode Yan, Min Guo:
Codes and Pseudo-Geometric Designs from the Ternary m-Sequences with Welch-type decimation d=2·3(n-1)/2+1. CoRR abs/2306.10744 (2023) - 2022
- [j71]Xiaoni Du, Rong Wang, Chunming Tang, Qi Wang
Infinite families of 2-designs from linear codes. Appl. Algebra Eng. Commun. Comput. 33(3): 193-211 (2022) - [j70]Xiaoni Du, Rong Wang, Chunming Tang, Qi Wang
Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros. Adv. Math. Commun. 16(1): 157-168 (2022) - [j69]Claude Carlet, Peng Han, Sihem Mesnager, Chunming Tang:
Möbius transformations and characterizations of hyper-bent functions from Dillon-like exponents with coefficients in extension fields. Adv. Math. Commun. 16(4): 709-720 (2022) - [j68]Can Xiang, Chunming Tang, Min Guo:
Some shortened codes from linear codes constructed by defining sets. Adv. Math. Commun. 16(4): 1059-1069 (2022) - [j67]Sihem Mesnager, Xiaohu Tang, Zhengchun Zhou, Chunming Tang, Qi Wang
Preface. Adv. Math. Commun. 16(4): i-ii (2022) - [j66]Can Xiang, Chunming Tang
An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). Des. Codes Cryptogr. 90(6): 1319-1333 (2022) - [j65]Jun Zhang
A class of twisted generalized Reed-Solomon codes. Des. Codes Cryptogr. 90(7): 1649-1658 (2022) - [j64]Qi Liu, Cunsheng Ding
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences. IEEE Trans. Inf. Theory 68(5): 3096-3107 (2022) - [j63]Can Xiang
Shortened Linear Codes From APN and PN Functions. IEEE Trans. Inf. Theory 68(6): 3780-3795 (2022) - [j62]Chunming Tang
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes. IEEE Trans. Inf. Theory 68(9): 5792-5801 (2022) - [j61]Chunming Tang
Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances. IEEE Trans. Inf. Theory 68(12): 7842-7849 (2022) - [c5]Yue Zhao
The Projective General Linear Group PGL(2, 5m) and Linear Codes of Length 5m+1. WAIFI 2022: 183-193 - [i58]Jun Zhang, Zhengchun Zhou, Chunming Tang:
A class of twisted generalized Reed-Solomon codes. CoRR abs/2202.09011 (2022) - [i57]Can Xiang, Chunming Tang:
Some 3-designs and shortened codes from binary cyclic codes with three zeros. CoRR abs/2206.15153 (2022) - [i56]Xiaoqiang Wang, Chunming Tang, Cunsheng Ding:
Infinite families of cyclic and negacyclic codes supporting 3-designs. CoRR abs/2207.07262 (2022) - 2021
- [j60]Hongming Ru, Chunming Tang, Yanfeng Qi, Yuxiao Deng:
A construction of p-ary linear codes with two or three weights. Adv. Math. Commun. 15(1): 9-22 (2021) - [j59]Chunming Tang, Maozhi Xu, Yanfeng Qi, Mingshuo Zhou:
A new class of p-ary regular bent functions. Adv. Math. Commun. 15(1): 55-64 (2021) - [j58]Cunsheng Ding, Chunming Tang:
Infinite families of 3-designs from o-polynomials. Adv. Math. Commun. 15(4): 557-573 (2021) - [j57]Cunsheng Ding
The linear codes of t-designs held in the Reed-Muller and Simplex codes. Cryptogr. Commun. 13(6): 927-949 (2021) - [j56]Cunsheng Ding, Chunming Tang
The projective general linear group ${\mathrm {PGL}}(2, 2^m)$ and linear codes of length 2m+1. Des. Codes Cryptogr. 89(7): 1713-1734 (2021) - [j55]Chunming Tang
An Infinite Family of Linear Codes Supporting 4-Designs. IEEE Trans. Inf. Theory 67(1): 244-254 (2021) - [j54]Kanat S. Abdukhalikov
Cyclic Bent Functions and Their Applications in Sequences. IEEE Trans. Inf. Theory 67(6): 3473-3485 (2021) - [j53]Chunming Tang
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets. IEEE Trans. Inf. Theory 67(6): 3690-3700 (2021) - [j52]Sihem Mesnager
Fast Algebraic Immunity of Boolean Functions and LCD Codes. IEEE Trans. Inf. Theory 67(7): 4828-4837 (2021) - [j51]Yang Liu, Cunsheng Ding
Shortened Linear Codes Over Finite Fields. IEEE Trans. Inf. Theory 67(8): 5119-5132 (2021) - [j50]Hang Chen
A Novel Application of Boolean Functions With High Algebraic Immunity in Minimal Codes. IEEE Trans. Inf. Theory 67(10): 6856-6867 (2021) - [i55]Chunming Tang, Qi Wang, Cunsheng Ding:
The subfield codes and subfield subcodes of a family of MDS codes. CoRR abs/2106.07840 (2021) - [i54]Qi Liu, Cunsheng Ding, Sihem Mesnager, Chunming Tang, Vladimir D. Tonchev:
On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and their Consequences. CoRR abs/2109.09051 (2021) - [i53]Chunming Tang, Peng Han, Qi Wang, Jun Zhang, Yanfeng Qi:
An Open Problem on the Bentness of Mesnager's Functions. CoRR abs/2109.13421 (2021) - [i52]Can Xiang, Chunming Tang, Qi Liu:
An infinite family of antiprimitive cyclic codes supporting Steiner systems S(3, 8, 7m+1). CoRR abs/2110.03881 (2021) - [i51]Chunming Tang, Peng Han, Qi Wang, Jun Zhang, Yanfeng Qi:
An Open Problem on the Bentness of Mesnager’s Functions. IACR Cryptol. ePrint Arch. 2021: 1304 (2021) - 2020
- [j49]Sihem Mesnager
On the Menezes-Teske-Weng conjecture. Cryptogr. Commun. 12(1): 19-27 (2020) - [j48]Cunsheng Ding, Chunming Tang
Combinatorial t-designs from special functions. Cryptogr. Commun. 12(5): 1011-1033 (2020) - [j47]Xin Ling, Sihem Mesnager, Yanfeng Qi, Chunming Tang
A class of narrow-sense BCH codes over $\mathbb {F}_q$ of length $\frac{q^m-1}{2}$. Des. Codes Cryptogr. 88(2): 413-427 (2020) - [j46]Cunsheng Ding, Chunming Tang
Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes. Des. Codes Cryptogr. 88(4): 625-641 (2020) - [j45]Sihem Mesnager, Chunming Tang
On the boomerang uniformity of quadratic permutations. Des. Codes Cryptogr. 88(10): 2233-2246 (2020) - [j44]Yanfeng Qi, Sihem Mesnager, Chunming Tang:
Codebooks from generalized bent Z4-valued quadratic forms. Discret. Math. 343(3): 111736 (2020) - [j43]Sihem Mesnager
New characterizations and construction methods of bent and hyper-bent Boolean functions. Discret. Math. 343(11): 112081 (2020) - [j42]Chunming Tang
Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs. IEEE Trans. Inf. Theory 66(6): 3691-3703 (2020) - [j41]Sihem Mesnager
Minimal Linear Codes From Characteristic Functions. IEEE Trans. Inf. Theory 66(9): 5404-5413 (2020) - [j40]Cunsheng Ding
Infinite Families of Near MDS Codes Holding t-Designs. IEEE Trans. Inf. Theory 66(9): 5419-5428 (2020) - [i50]Chunming Tang, Cunsheng Ding:
An infinite family of linear codes supporting 4-designs. CoRR abs/2001.00158 (2020) - [i49]Hang Chen, Cunsheng Ding, Sihem Mesnager, Chunming Tang:
A Novel Application of Boolean Functions with High Algebraic Immunity in Minimal Codes. CoRR abs/2004.04932 (2020) - [i48]Sihem Mesnager, Chunming Tang:
Fast algebraic immunity of Boolean functions and LCD codes. CoRR abs/2006.08372 (2020) - [i47]Yang Liu, Cunsheng Ding, Chunming Tang:
Shortened Linear Codes over Finite Fields. CoRR abs/2007.05901 (2020) - [i46]Can Xiang, Chunming Tang, Cunsheng Ding:
Shortened linear codes from APN and PN functions. CoRR abs/2007.05923 (2020) - [i45]Cunsheng Ding, Chunming Tang:
The linear codes of t-designs held in the Reed-Muller and Simplex codes. CoRR abs/2008.09935 (2020) - [i44]Cunsheng Ding, Chunming Tang, Vladimir D. Tonchev:
The Projective General Linear Group PGL2(GF(2sm)) and Linear Codes of Length 2m+1. CoRR abs/2010.09448 (2020) - [i43]Sihem Mesnager, Chunming Tang:
Fast algebraic immunity of Boolean functions and LCD codes. IACR Cryptol. ePrint Arch. 2020: 720 (2020)
2010 – 2019
- 2019
- [j39]Dongmei Huang, Chunming Tang, Yanfeng Qi, Maozhi Xu:
New quadratic bent functions in polynomial forms with coefficients in extension fields. Appl. Algebra Eng. Commun. Comput. 30(4): 333-347 (2019) - [j38]Xia Li, Feng Cheng, Chunming Tang, Zhengchun Zhou:
Some classes of LCD codes and self-orthogonal codes over finite fields. Adv. Math. Commun. 13(2): 267-280 (2019) - [j37]Chunming Tang
Regular p-ary bent functions with five terms and Kloosterman sums. Cryptogr. Commun. 11(5): 1133-1144 (2019) - [j36]Sihem Mesnager, Fengrong Zhang
Further study on the maximum number of bent components of vectorial functions. Des. Codes Cryptogr. 87(11): 2597-2610 (2019) - [j35]Chunming Tang
Steiner systems $$S(2, 4, \frac{3^m-1}{2})$$ and 2-designs from ternary linear codes of length $$\frac{3^m-1}{2}$$. Des. Codes Cryptogr. 87(12): 2793-2811 (2019) - [j34]Zhengchun Zhou
Binary LCD Codes and Self-Orthogonal Codes From a Generic Construction. IEEE Trans. Inf. Theory 65(1): 16-27 (2019) - [j33]Claude Carlet
New Characterization and Parametrization of LCD Codes. IEEE Trans. Inf. Theory 65(1): 39-49 (2019) - [j32]Claude Carlet
On $\sigma$ -LCD Codes. IEEE Trans. Inf. Theory 65(3): 1694-1704 (2019) - [i42]Chunming Tang, Cunsheng Ding, Maosheng Xiong:
Steiner systems S(2, 4, 3m-1/2) and 2-designs from ternary linear codes of length 3m-1/2. CoRR abs/1901.09228 (2019) - [i41]Sihem Mesnager, Chunming Tang, Maosheng Xiong:
On the boomerang uniformity of (quadratic) permutations over F2n. CoRR abs/1903.00501 (2019) - [i40]Xin Ling, Sihem Mesnager, Yanfeng Qi, Chunming Tang:
A class of narrow-sense BCH codes over Fq of length (qm-1)/2. CoRR abs/1903.06779 (2019) - [i39]Yanfeng Qi, Sihem Mesnager, Chunming Tang:
Codebooks from generalized bent Z4-valued quadratic forms. CoRR abs/1905.08834 (2019) - [i38]Cunsheng Ding, Chunming Tang, Vladimir D. Tonchev:
Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes. CoRR abs/1907.13032 (2019) - [i37]Chunming Tang, Cunsheng Ding, Maosheng Xiong:
Codes, differentially δ-uniform functions and t-designs. CoRR abs/1907.13036 (2019) - [i36]Sihem Mesnager, Yanfeng Qi, Hongming Ru, Chunming Tang:
Minimal linear codes from characteristic functions. CoRR abs/1908.01650 (2019) - [i35]Cunsheng Ding, Chunming Tang:
Infinite families of near MDS codes holding t-designs. CoRR abs/1910.08265 (2019) - [i34]Chunming Tang, Yan Qiu, Qunying Liao, Zhengchun Zhou:
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets. CoRR abs/1911.09867 (2019) - [i33]Sihem Mesnager, Chunming Tang, Maosheng Xiong:
On the boomerang uniformity of quadratic permutations over 픽2n. IACR Cryptol. ePrint Arch. 2019: 277 (2019) - 2018
- [j31]Chunming Tang, Yanfeng Qi, Zhengchun Zhou, Cuiling Fan:
Two infinite classes of rotation symmetric bent functions with simple representation. Appl. Algebra Eng. Commun. Comput. 29(3): 197-208 (2018) - [j30]Can Xiang
Two classes of linear codes and their weight distributions. Appl. Algebra Eng. Commun. Comput. 29(3): 209-225 (2018) - [j29]Yanfeng Qi, Chunming Tang, Dongmei Huang:
Explicit characterization of two classes of regular bent functions. Appl. Algebra Eng. Commun. Comput. 29(6): 529-544 (2018) - [j28]Yanfeng Qi, Chunming Tang, Zhengchun Zhou, Cuiling Fan:
Several infinite families of p-ary weakly regular bent functions. Adv. Math. Commun. 12(2): 303-315 (2018) - [j27]Claude Carlet
Euclidean and Hermitian LCD MDS codes. Des. Codes Cryptogr. 86(11): 2605-2618 (2018) - [j26]Sihem Mesnager
Complementary Dual Algebraic Geometry Codes. IEEE Trans. Inf. Theory 64(4): 2390-2397 (2018) - [j25]Claude Carlet
Linear Codes Over 𝔽q Are Equivalent to LCD Codes for q>3. IEEE Trans. Inf. Theory 64(4): 3010-3017 (2018) - [j24]Sihem Mesnager
2-Correcting Lee Codes: (Quasi)-Perfect Spectral Conditions and Some Constructions. IEEE Trans. Inf. Theory 64(4): 3031-3041 (2018) - [j23]Sihem Mesnager
Further Results on Generalized Bent Functions and Their Complete Characterization. IEEE Trans. Inf. Theory 64(7): 5441-5452 (2018) - [i32]Sihem Mesnager, Fengrong Zhang, Chunming Tang, Yong Zhou:
Further study on the maximum number of bent components of vectorial functions. CoRR abs/1801.06542 (2018) - [i31]Sihem Mesnager, Kwang Ho Kim, Junyop Choe, Chunming Tang:
On the Menezes-Teske-Weng's conjecture. CoRR abs/1807.01858 (2018) - [i30]Cunsheng Ding, Sihem Mesnager, Chunming Tang, Maosheng Xiong:
Cyclic bent functions and their applications in codes, codebooks, designs, MUBs and sequences. CoRR abs/1811.07725 (2018) - [i29]Sihem Mesnager, Kwang Ho Kim, Junyop Choe, Chunming Tang:
On the Menezes-Teske-Weng's conjecture. IACR Cryptol. ePrint Arch. 2018: 659 (2018) - 2017
- [j22]Can Xiang
A class of linear codes with a few weights. Cryptogr. Commun. 9(1): 93-116 (2017) - [j21]Chunming Tang, Yanfeng Qi:
A class of hyper-bent functions and Kloosterman sums. Cryptogr. Commun. 9(5): 647-664 (2017) - [j20]Chunming Tang, Can Xiang
Linear codes with few weights from inhomogeneous quadratic functions. Des. Codes Cryptogr. 83(3): 691-714 (2017) - [j19]Can Xiang
A Construction of Linear Codes Over 𝔽2t From Boolean Functions. IEEE Trans. Inf. Theory 63(1): 169-176 (2017) - [j18]Chunming Tang
Complete Characterization of Generalized Bent and 2k-Bent Boolean Functions. IEEE Trans. Inf. Theory 63(7): 4668-4674 (2017) - [j17]Sihem Mesnager
Generalized Plateaued Functions and Admissible (Plateaued) Functions. IEEE Trans. Inf. Theory 63(10): 6139-6148 (2017) - [j16]Chunming Tang
Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees. IEEE Trans. Inf. Theory 63(10): 6149-6157 (2017) - [i28]Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi:
Euclidean and Hermitian LCD MDS codes. CoRR abs/1702.08033 (2017) - [i27]Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi:
Linear codes over Fq which are equivalent to LCD codes. CoRR abs/1703.04346 (2017) - [i26]Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi:
On σ-LCD codes. CoRR abs/1707.08789 (2017) - [i25]Claude Carlet, Sihem Mesnager, Chunming Tang, Yanfeng Qi:
New characterization and parametrization of LCD Codes. CoRR abs/1709.03217 (2017) - 2016
- [j15]Chunming Tang, Yanfeng Qi:
Special values of Kloosterman sums and binomial bent functions. Finite Fields Their Appl. 41: 113-131 (2016) - [j14]Huiting Han, Chunming Tang, Yu Lou, Maozhi Xu:
Construction of Efficient MDS Matrices Based on Block Circulant Matrices for Lightweight Application. Fundam. Informaticae 145(2): 111-124 (2016) - [j13]Chunming Tang, Yanfeng Qi, Dongmei Huang:
Two-Weight and Three-Weight Linear Codes From Square Functions. IEEE Commun. Lett. 20(1): 29-32 (2016) - [j12]Yanfeng Qi, Chunming Tang, Dongmei Huang:
Binary Linear Codes With Few Weights. IEEE Commun. Lett. 20(2): 208-211 (2016) - [j11]Can Xiang, Chunming Tang:
New verifiable outsourced computation scheme for an arbitrary function. Int. J. Grid Util. Comput. 7(3): 190-199 (2016) - [j10]Can Xiang
Privacy-preserving face recognition with outsourced computation. Soft Comput. 20(9): 3735-3744 (2016) - [j9]Chunming Tang, Nian Li, Yanfeng Qi, Zhengchun Zhou, Tor Helleseth:
Linear Codes With Two or Three Weights From Weakly Regular Bent Functions. IEEE Trans. Inf. Theory 62(3): 1166-1176 (2016) - [i24]Chunming Tang, Can Xiang, Keqin Feng:
Linear codes with a few weights from inhomogeneous quadratic functions. CoRR abs/1602.01511 (2016) - [i23]Sihem Mesnager, Chunming Tang, Yanfeng Qi:
Quasi-Perfect Lee Codes from Quadratic Curves over Finite Fields. CoRR abs/1608.06748 (2016) - [i22]Sihem Mesnager, Chunming Tang, Yanfeng Qi:
Complementary Dual Algebraic Geometry Codes. CoRR abs/1609.05649 (2016) - [i21]Chunming Tang, Can Xiang, Yanfeng Qi, Keqin Feng:
Complete characterization of generalized bent and 2^k-bent Boolean functions. IACR Cryptol. ePrint Arch. 2016: 335 (2016) - 2015
- [j8]Chunming Tang, Maozhi Xu, Yanfeng Qi:
Cryptography on twisted Edwards curves over local fields. Sci. China Inf. Sci. 58(1): 1-15 (2015) - [j7]Yu Lou, Huiting Han, Chunming Tang, Zhangqing Wu, Maozhi Xu:
Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition. Int. J. Comput. Math. 92(3): 451-462 (2015) - [j6]Can Xiang
Securely verifiable outsourcing schemes of matrix calculation. Int. J. High Perform. Comput. Netw. 8(2): 93-101 (2015) - [j5]Can Xiang
Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server. J. Ambient Intell. Humaniz. Comput. 6(1): 131-139 (2015) - [i20]Chunming Tang, Yanfeng Qi:
Two-weight and three-weight linear codes from weakly regular bent functions. CoRR abs/1507.06148 (2015) - [i19]Yanfeng Qi, Chunming Tang, Zhengchun Zhou, Cuiling Fan:
New infinite families of p-ary weakly regular bent functions. CoRR abs/1508.05672 (2015) - [i18]Chunming Tang, Yanfeng Qi, Zhengchun Zhou, Cuiling Fan:
Constructing bent functions and bent idempotents of any possible algebraic degrees. CoRR abs/1508.05673 (2015) - [i17]Chunming Tang, Yanfeng Qi, Zhengchun Zhou, Cuiling Fan:
Two infinite classes of rotation symmetric bent functions with simple representation. CoRR abs/1508.05674 (2015) - [i16]Can Xiang, Keqin Feng, Chunming Tang:
A Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions. CoRR abs/1511.02264 (2015) - [i15]Can Xiang, Chunming Tang, Keqin Feng:
A Class of Linear Codes with a Few Weights. CoRR abs/1512.07103 (2015) - 2014
- [j4]Chunming Tang, Yanfeng Qi, Maozhi Xu:
A note on cyclic codes from APN functions. Appl. Algebra Eng. Commun. Comput. 25(1-2): 21-37 (2014) - [j3]Chunming Tang, Dongmei Ni, Maozhi Xu, Baoan Guo, Yanfeng Qi:
Implementing optimized pairings with elliptic nets. Sci. China Inf. Sci. 57(5): 1-10 (2014) - [c4]Chunming Tang, Yanfeng Qi:
Constructing Hyper-Bent Functions from Boolean Functions with the Walsh Spectrum Taking the Same Value Twice. SETA 2014: 60-71 - [i14]Chunming Tang, Yanfeng Qi:
Constructing hyper-bent functions from Boolean functions with the Walsh spectrum taking the same value twice. IACR Cryptol. ePrint Arch. 2014: 524 (2014) - [i13]Can Xiang, Chunming Tang:
Privacy-Preserving Face Recognition with Outsourced Computation. IACR Cryptol. ePrint Arch. 2014: 969 (2014) - 2013
- [c3]Chunming Tang, Yu Lou, Yanfeng Qi, Maozhi Xu, Baoan Guo:
A Note on Semi-bent and Hyper-bent Boolean Functions. Inscrypt 2013: 3-21 - [c2]Yanfeng Qi, Chunming Tang, Yu Lou, Maozhi Xu, Baoan Guo:
An Attribute-Based Encryption Scheme with Constant-Size Ciphertexts. GreenCom/iThings/CPScom 2013: 1086-1088 - [i12]Chunming Tang, Yanfeng Qi, Maozhi Xu:
A Note on Cyclic Codes from APN Functions. CoRR abs/1305.7294 (2013) - [i11]Chunming Tang, Yanfeng Qi:
Effective Construction of a Class of Bent Quadratic Boolean Functions. CoRR abs/1308.2798 (2013) - [i10]Chunming Tang, Yanfeng Qi:
Special values of Kloosterman sums and binomial bent functions. CoRR abs/1312.7191 (2013) - [i9]Chunming Tang, Yanfeng Qi, Maozhi Xu:
New Quadratic Bent Functions in Polynomial Forms with Coefficients in Extension Fields. IACR Cryptol. ePrint Arch. 2013: 405 (2013) - [i8]Chunming Tang, Yanfeng Qi:
A new class of semi-bent quadratic Boolean functions. IACR Cryptol. ePrint Arch. 2013: 493 (2013) - [i7]Chunming Tang, Yanfeng Qi:
A new class of hyper-bent functions and Kloosterman sums. IACR Cryptol. ePrint Arch. 2013: 870 (2013) - 2012
- [j2]Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu:
The Weight Distributions of Cyclic Codes and Elliptic Curves. IEEE Trans. Inf. Theory 58(12): 7253-7259 (2012) - [i6]Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu:
A Note on Weight Distributions of Irreducible Cyclic Codes. CoRR abs/1202.3514 (2012) - [i5]Yu Lou, Huiting Han, Chunming Tang, Maozhi Xu:
Constructing Vectorial Boolean Functions with High Algebraic Immunity Based on Group Decomposition. IACR Cryptol. ePrint Arch. 2012: 335 (2012) - 2011
- [j1]Chunming Tang, Maozhi Xu, Yanfeng Qi:
Faster pairing computation on genus 2 hyperelliptic curves. Inf. Process. Lett. 111(10): 494-499 (2011) - [c1]Chenggen Song, Maozhi Xu, Chunming Tang:
Pseudorandom Generators Based on Subcovers for Finite Groups. Inscrypt 2011: 379-392 - [i4]Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu:
The Weight Distributions of Cyclic Codes and Elliptic Curves. CoRR abs/1109.0628 (2011) - [i3]Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu:
A new class of hyper-bent Boolean functions in binomial forms. CoRR abs/1112.0062 (2011) - [i2]Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang, Maozhi Xu:
A New Class of Hyper-bent Boolean Functions with Multiple Trace Terms. IACR Cryptol. ePrint Arch. 2011: 600 (2011) - [i1]Baocheng Wang, Chunming Tang, Yanfeng Qi, Yixian Yang:
A generalization of the class of hyper-bent Boolean functions in binomial forms. IACR Cryptol. ePrint Arch. 2011: 698 (2011)
Coauthor Index
[j74] [c5] [j60] [j59] [i53] [i51] [j47] [j44] [j41] [j39] [j37] [j33] [j32] [i40] [i39] [i36] [j31] [j29] [j28] [j27] [j26] [j25] [j24] [j23] [j21] [j18] [j17] [j16] [i28] [i27] [i26] [i25] [j15] [j13] [j12] [j9] [i23] [i22] [i21] [j8] [i20] [i19] [i18] [i17] [j4] [j3] [c4] [i14] [c3] [c2] [i12] [i11] [i10] [i9] [i8] [i7] [j2] [i6] [j1] [i4] [i3] [i2] [i1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-13 19:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: