Zhixiong Chen
Orcid: 0000-0003-4228-0023Affiliations:
- Putian University, Provincial Key Laboratory of Applied Mathematics, Fujian, China
- University of Kentucky, Lexington, KY, USA (2014 - 2015)
- Austrian Academy of Sciences, Linz, Austria (2013)
- Xidian University, State Key Laboratory of Integrated Services Networks, Shaanxi, China (PhD 2006)
- Chinese Academy of Sciences, State Key Laboratory of Information Security, Institute of Software, Beijing, China
- Fujian Normal University, Department of Mathematics, China (former)
According to our database1,
Zhixiong Chen
authored at least 74 papers
between 2006 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
IEEE Trans. Smart Grid, September, 2023
Cryptologia, September, 2023
Int. J. Found. Comput. Sci., June, 2023
IET Inf. Secur., March, 2023
Some Classes of Cryptographic Power Functions and Permutation Polynomials with Low (-1)-Differential Uniformity in Cyber Security.
Proceedings of the IEEE Intl Conf on Dependable, 2023
New Cryptographic Bent Functions from Permutations and Linear Translator in Cyber Security.
Proceedings of the IEEE Intl Conf on Dependable, 2023
2022
J. Appl. Math. Comput., October, 2022
IEEE Trans. Inf. Theory, 2022
Characterization and Construction of Generalized Bent Functions with Flexible Coefficients.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2022
Correlation measure, linear complexity and maximum order complexity for families of binary sequences.
Finite Fields Their Appl., 2022
Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022
2021
Correlation, Linear Complexity, Maximum order Complexity on Families of binary Sequences.
CoRR, 2021
2020
A Family of Pseudorandom Binary Sequences Derived from Generalized Syclotomic Classes Modulo p^{m+1}q^{n+1}.
Int. J. Netw. Secur., 2020
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2020
Sci. China Inf. Sci., 2020
The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude.
Cryptogr. Commun., 2020
2019
On error linear complexity of new generalized cyclotomic binary sequences of period <i>p</i><sup>2</sup>.
Inf. Process. Lett., 2019
On the k-Error Linear Complexity of Binary Sequences Derived from the Discrete Logarithm in Finite Fields.
Complex., 2019
2018
Des. Codes Cryptogr., 2018
The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude.
CoRR, 2018
Cryptogr. Commun., 2018
On the linear complexities of two classes of quaternary sequences of even length with optimal autocorrelation.
Adv. Math. Commun., 2018
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients.
Adv. Math. Commun., 2018
2017
Linear Complexity of Quaternary Sequences Over Z4 Derived From Generalized Cyclotomic Classes Modulo 2p.
Int. J. Netw. Secur., 2017
On error linear complexity of new generalized cyclotomic binary sequences of period p<sup>2</sup>.
CoRR, 2017
Linear complexity and trace representation of quaternary sequences over ℤ<sub>4</sub> based on generalized cyclotomic classes modulo pq.
Cryptogr. Commun., 2017
2016
Linear complexity of quaternary sequences over Z_4 derived from generalized cyclotomic classes modulo 2p.
CoRR, 2016
Linear complexity problems of level sequences of Euler quotients and their related binary sequences.
Sci. China Inf. Sci., 2016
2015
Linear complexity and trace representation of quaternary sequences over $\mathbb{Z}_4$ based on generalized cyclotomic classes modulo $pq$.
CoRR, 2015
On the k-error linear complexity of binary sequences derived from polynomial quotients.
Sci. China Inf. Sci., 2015
Appl. Algebra Eng. Commun. Comput., 2015
Further results on pseudorandom binary sequences derived from Fermat-Euler Quotients.
Proceedings of the 10th International Conference on Information, 2015
2014
Period. Math. Hung., 2014
A general construction of binary interleaved sequences of period 4N with optimal autocorrelation.
Inf. Sci., 2014
Trace representation and linear complexity of binary sequences derived from Fermat quotients.
Sci. China Inf. Sci., 2014
2013
On the linear complexity of binary threshold sequences derived from Fermat quotients.
Des. Codes Cryptogr., 2013
2012
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations.
Inf. Process. Lett., 2012
Linear complexity of binary sequences derived from Euler quotients with prime-power modulus.
Inf. Process. Lett., 2012
Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012
Computing the <i>k</i>-Error Linear Complexity of <i>q</i>-Ary Sequences with Period 2<i>p<sub>n</sub></i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012
Proceedings of the Sequences and Their Applications - SETA 2012, 2012
2011
J. Comput. Sci. Technol., 2011
Linear Complexity of Quaternary Sequences Generated Using Generalized Cyclotomic Classes Modulo 2<i>p</i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011
Trace Representation of Binary Generalized Cyclotomic Sequences with Length <i>p<sup>m</sup></i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011
2010
Construction of Large Families of Pseudorandom Subsets of the Set {1, 2, ..., N} Using Elliptic Curves.
Int. J. Netw. Secur., 2010
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length <i>pq</i>.
Frontiers Comput. Sci. China, 2010
Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010
A Family of Binary Threshold Sequences Constructed by Using the Multiplicative Inverse.
Proceedings of the Information Security and Cryptology - 6th International Conference, 2010
2009
Trace Representation of a New Class of Sextic Residue Sequences of Period <i>p</i>=3 ( mod 8).
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
IACR Cryptol. ePrint Arch., 2009
2008
J. Comput. Sci. Technol., 2008
Finite Fields Their Appl., 2008
Comparison of Algorithms for Speaker Identification under Adverse Far-Field Recording Conditions with Extremely Short Utterances.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2008
2007
Autocorrelation Values of New Generalized Cyclotomic Sequences of Order Two and Length <i>pq</i>.
J. Comput. Sci. Technol., 2007
Efficient elliptic curve scalar multiplication algorithms resistant to power analysis.
Inf. Sci., 2007
On the Randomness of Generalized Cyclotomic Sequences of Order Two and Length <i>pq</i>.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007
IACR Cryptol. ePrint Arch., 2007
Proceedings of the Information Security and Cryptology, Third SKLOIS Conference, 2007
2006
Construction of Pseudo-random Binary Sequences from Elliptic Curves by Using Discrete Logarithm.
Proceedings of the Sequences and Their Applications, 2006