Convertible Undeniable Partially Blind Signatures. - Zhenjie Huang; Zhixiong Chen 002; Yumin Wang (AINA, 2005)

Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm. - Zhixiong Chen 002; Shengqiang Li; Guozhen Xiao (SETA, 2006)

Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves. - Zhixiong Chen 002; Ning Zhang; Guozhen Xiao (Inscrypt, 2007)

'Good' Pseudo-Random Binary Sequences from Elliptic Curves. - Zhixiong Chen 002; Guozhen Xiao (IACR Cryptol. ePrint Arch., 2007)

On the Randomness of Generalized Cyclotomic Sequences of Order Two and Length pq. - Shengqiang Li; Zhixiong Chen 002; Rong Sun; Guozhen Xiao (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

Sequences related to Legendre/Jacobi sequences. - Zhixiong Chen 002; Xiaoni Du; Guozhen Xiao (Inf. Sci., 2007)

Efficient elliptic curve scalar multiplication algorithms resistant to power analysis. - Ning Zhang; Zhixiong Chen 002; Guozhen Xiao (Inf. Sci., 2007)

Autocorrelation Values of New Generalized Cyclotomic Sequences of Order Two and Length pq. - Shengqiang Li; Zhixiong Chen 002; Xiaotong Fu; Guozhen Xiao (J. Comput. Sci. Technol., 2007)

Comparison of Algorithms for Speaker Identification under Adverse Far-Field Recording Conditions with Extremely Short Utterances. - Hao Tang 001; Zhixiong Chen 002; Thomas S. Huang (ICNSC, 2008)

Finite binary sequences constructed by explicit inversive methods. - Zhixiong Chen 002 (Finite Fields Their Appl., 2008)

On the linear complexity of some new q. - Xiaoni Du; Zhixiong Chen 002; Guozhen Xiao (Inf. Sci., 2008)

Some Notes on Generalized Cyclotomic Sequences of Length pq. - Zhixiong Chen 002; Shengqiang Li (J. Comput. Sci. Technol., 2008)

Construction of large families of pseudorandom subsets using elliptic curves. - Zhixiong Chen 002; Chenhuang Wu (IACR Cryptol. ePrint Arch., 2009)

A Construction of Binary Cyclotomic Sequences Using Extension Fields. - Zhixiong Chen 002; Xiaoni Du; Rong Sun (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Trace Representation of a New Class of Sextic Residue Sequences of Period p=3 ( mod 8). - Xiaoni Du; Zhixiong Chen 002; Ailing Shi; Rong Sun (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

A Family of Binary Threshold Sequences Constructed by Using the Multiplicative Inverse. - Zhixiong Chen 002; Xiangguo Cheng; Chenhuang Wu (Inscrypt, 2010)

Structure of Pseudorandom Numbers Derived from Fermat Quotients. - Zhixiong Chen 002; Alina Ostafe; Arne Winterhof (WAIFI, 2010)

Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq. - Zhixiong Chen 002; Xiaoni Du (Frontiers Comput. Sci. China, 2010)

Large Family of Sequences from Elliptic Curves over Residue Class Rings. - Shengqiang Li; Zhixiong Chen 002; Liang Zhou (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

Construction of Large Families of Pseudorandom Subsets of the Set {1, 2, ..., N} Using Elliptic Curves. - Zhixiong Chen 002; Li Xu 002; Chenhuang Wu (Int. J. Netw. Secur., 2010)

Trace Representation of Binary Generalized Cyclotomic Sequences with Length pm. - Xiaoni Du; Zhixiong Chen 002 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Linear Complexity of Quaternary Sequences Generated Using Generalized Cyclotomic Classes Modulo 2p. - Xiaoni Du; Zhixiong Chen 002 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Pseudo-Randomness of Certain Sequences of k Symbols with Length pq. - Zhixiong Chen 002; Xiaoni Du; Chenhuang Wu (J. Comput. Sci. Technol., 2011)

Linear Complexity of Binary Sequences Derived from Polynomial Quotients. - Zhixiong Chen 002; Domingo Gómez-Pérez (SETA, 2012)

Computing the k-Error Linear Complexity of q-Ary Sequences with Period 2pn. - Zhihua Niu; Zhe Li; Zhixiong Chen 002; Tongjiang Yan (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus. - Chenhuang Wu; Zhixiong Chen 002; Xiaoni Du (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012)

Linear complexity of binary sequences derived from Euler quotients with prime-power modulus. - Xiaoni Du; Zhixiong Chen 002; Lei Hu (Inf. Process. Lett., 2012)

Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations. - Xiaoni Du; Andrew Klapper; Zhixiong Chen 002 (Inf. Process. Lett., 2012)

On the linear complexity of binary threshold sequences derived from Fermat quotients. - Zhixiong Chen 002; Xiaoni Du (Des. Codes Cryptogr., 2013)

A generalization of the Hall's sextic residue sequences. - Xiaoni Du; Zhixiong Chen 002 (Inf. Sci., 2013)

Trace representation and linear complexity of binary sequences derived from Fermat quotients. - Zhixiong Chen 002 (Sci. China Inf. Sci., 2014)

A General Construction of Binary Sequences with Optimal Autocorrelation. - Tongjiang Yan; Zhixiong Chen 002; Bao Li 001 (CoRR, 2014)

A general construction of binary interleaved sequences of period 4N with optimal autocorrelation. - Tongjiang Yan; Zhixiong Chen 002; Bao Li 001 (Inf. Sci., 2014)

On lattice profile of the elliptic curve linear congruential generators. - Zhixiong Chen 002; Domingo Gómez-Pérez; Gottlieb Pirsic (Period. Math. Hung., 2014)

Interpolation of Fermat Quotients. - Zhixiong Chen 002; Arne Winterhof (SIAM J. Discret. Math., 2014)

Covering Sets for Limited-Magnitude Errors. - Zhixiong Chen 002; Igor E. Shparlinski; Arne Winterhof (IEEE Trans. Inf. Theory, 2014)

Further results on pseudorandom binary sequences derived from Fermat-Euler Quotients. - Zhifan Ye; Pinhui Ke; Zhixiong Chen 002 (ICICS, 2015)

Trace representation of pseudorandom binary sequences derived from Euler quotients. - Zhixiong Chen 002; Xiaoni Du; Radwa Marzouk (Appl. Algebra Eng. Commun. Comput., 2015)

On the k-error linear complexity of binary sequences derived from polynomial quotients. - Zhixiong Chen 002; Zhihua Niu; Chenhuang Wu (Sci. China Inf. Sci., 2015)

Linear complexity and trace representation of quaternary sequences over $ mathbb{Z}_4$ based on generalized cyclotomic classes modulo $pq$. - Zhixiong Chen 002 (CoRR, 2015)

Linear complexity problems of level sequences of Euler quotients and their related binary sequences. - Zhihua Niu; Zhixiong Chen 002; Xiaoni Du (Sci. China Inf. Sci., 2016)

Linear complexity of quaternary sequences over Z_4 derived from generalized cyclotomic classes modulo 2p. - Zhixiong Chen 002; Vladimir Edemskiy (CoRR, 2016)

Linear complexity and trace representation of quaternary sequences over ℤ4 based on generalized cyclotomic classes modulo pq. - Zhixiong Chen 002 (Cryptogr. Commun., 2017)

On error linear complexity of new generalized cyclotomic binary sequences of period p2. - Chenhuang Wu; Chunxiang Xu; Zhixiong Chen 002; Pinhui Ke (CoRR, 2017)

Linear Complexity of Quaternary Sequences Over Z4 Derived From Generalized Cyclotomic Classes Modulo 2p. - Zhixiong Chen 002; Vladimir Edemskiy (Int. J. Netw. Secur., 2017)

On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. - Zhixiong Chen 002; Vladimir Edemskiy; Pinhui Ke; Chenhuang Wu (Adv. Math. Commun., 2018)

On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation. - Pinhui Ke; Yueqin Jiang; Zhixiong Chen 002 (Adv. Math. Commun., 2018)

Correlation immune functions with respect to the q-transform. - Ting Gu; Zhixiong Chen 002; Andrew Klapper (Cryptogr. Commun., 2018)

The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude. - Yuhua Sun; Tongjiang Yan; Zhixiong Chen 002 (CoRR, 2018)

Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction. - Weihua Liu; Andrew Klapper; Zhixiong Chen 002 (Des. Codes Cryptogr., 2018)

Linear complexity of Legendre-polynomial quotients. - Zhixiong Chen 002 (IET Inf. Secur., 2018)

On the Nonexistence of q-Bent Boolean Functions. - Andrew Klapper; Zhixiong Chen 002 (IEEE Trans. Inf. Theory, 2018)

On the k-Error Linear Complexity of Binary Sequences Derived from the Discrete Logarithm in Finite Fields. - Zhixiong Chen 002; Qiuyan Wang (Complex., 2019)

On the q-bentness of Boolean functions. - Zhixiong Chen 002; Ting Gu; Andrew Klapper (Des. Codes Cryptogr., 2019)

On error linear complexity of new generalized cyclotomic binary sequences of period p2. - Chenhuang Wu; Chunxiang Xu; Zhixiong Chen 002; Pinhui Ke (Inf. Process. Lett., 2019)

The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude. - Yuhua Sun; Tongjiang Yan; Zhixiong Chen 002; Lianhai Wang (Cryptogr. Commun., 2020)

On the k -error linear complexity of 2 p 2 -periodic binary sequences. - Zhihua Niu; Can Yuan; Zhixiong Chen 002; Xiaoni Du; Tao Zhang 046 (Sci. China Inf. Sci., 2020)

On q-nearly bent Boolean functions. - Zhixiong Chen 002; Andrew Klapper (Discret. Appl. Math., 2020)

On the Signal-to-Noise Ratio for Boolean Functions. - Yu Zhou; Wei Zhao; Zhixiong Chen 002; Weiqiong Wang; Xiaoni Du (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020)

A Family of Pseudorandom Binary Sequences Derived from Generalized Syclotomic Classes Modulo p^{m+1}q^{n+1}. - Xiaolin Chen; Zhixiong Chen 002; Huaning Liu (Int. J. Netw. Secur., 2020)

Correlation, Linear Complexity, Maximum order Complexity on Families of binary Sequences. - Zhixiong Chen 002; Ana-Isabel Gómez; Domingo Gómez-Pérez; Andrew Z. Tirkel (CoRR, 2021)

Correlation measures of binary sequences derived from Euler quotients. - Huaning Liu; Zhixiong Chen 002; Chenhuang Wu (CoRR, 2021)

Arithmetic Autocorrelation of Binary m-Sequences. - Zhixiong Chen 002; Zhihua Niu; Yuqi Sang; Chenhuang Wu (CoRR, 2021)

Boolean Functions with Few Walsh Transform Values. - Pinhui Ke; Zhixiong Chen 002 (IWSDA, 2022)

Correlation measure, linear complexity and maximum order complexity for families of binary sequences. - Zhixiong Chen 002; Ana-Isabel Gómez; Domingo Gómez-Pérez; Andrew Z. Tirkel (Finite Fields Their Appl., 2022)

Characterization and Construction of Generalized Bent Functions with Flexible Coefficients. - Zhiyao Yang; Pinhui Ke; Zhixiong Chen 002 (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022)

Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods. - Zhixiong Chen 002; Zhihua Niu; Arne Winterhof (IEEE Trans. Inf. Theory, 2022)

On the 4-adic complexity of the two-prime quaternary generator. - Vladimir Edemskiy; Zhixiong Chen 002 (J. Appl. Math. Comput., 2022)

New Cryptographic Bent Functions from Permutations and Linear Translator in Cyber Security. - Qian Liu; Yan Chen; Zhixiong Chen 002; Ximeng Liu; Hui Lin (DASC/PiCom/CBDCom/CyberSciTech, 2023)

Some Classes of Cryptographic Power Functions and Permutation Polynomials with Low (-1)-Differential Uniformity in Cyber Security. - Qian Liu; Xiaobei Dong; Zhixiong Chen 002; Ximeng Liu; Li Xu 002 (DASC/PiCom/CBDCom/CyberSciTech, 2023)

Arithmetic correlation of binary half- ℓ -sequences. - Zhixiong Chen 002; Vladimir Edemskiy; Zhihua Niu; Yuqi Sang (IET Inf. Secur., 2023)

Results on the Gowers U2 Norm of Generalized Boolean Functions. - Zhiyao Yang; Pinhui Ke; Zhixiong Chen 002; Chenhuang Wu (Int. J. Found. Comput. Sci., 2023)

Arithmetic autocorrelation of binary m-sequences. - Zhixiong Chen 002; Zhihua Niu; Yuqi Sang; Chenhuang Wu (Cryptologia, 2023)

Privacy-Preserving Electricity Theft Detection Based on Blockchain. - Zhiqiang Zhao; Yi-Ning Liu 002; Zhixin Zeng; Zhixiong Chen 002; Huiyu Zhou 001 (IEEE Trans. Smart Grid, 2023)

Robust and privacy-preserving federated learning with distributed additive encryption against poisoning attacks. - Fan Zhang; Hui Huang 010; Zhixiong Chen 002; Zhenjie Huang (Comput. Networks, 2024)

Maximum-Order Complexity and 2-Adic Complexity. - Zhiru Chen; Zhixiong Chen 002; Jakob Obrovsky; Arne Winterhof (IEEE Trans. Inf. Theory, 2024)

On the Nth 2-adic complexity of binary sequences identified with algebraic 2-adic integers. - Zhixiong Chen 002; Arne Winterhof (Discret. Appl. Math., 2025)