Chenhuang Wu
Orcid: 0000-0001-8002-7630
According to our database1,
Chenhuang Wu
authored at least 37 papers
between 2009 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Connect. Sci., December, 2023
Cryptologia, September, 2023
Int. J. Found. Comput. Sci., June, 2023
2022
Int. J. Commun. Syst., 2022
Improvements on <i>k</i>-error linear complexity of <i>q</i>-ary sequences derived from Euler quotients.
Cryptologia, 2022
A secure and efficient data deduplication framework for the internet of things via edge computing and blockchain.
Connect. Sci., 2022
Linear Complexity of Generalized Cyclotomic Sequences with Period p<sup>n</sup>q<sup>m</sup>.
Proceedings of the Arithmetic of Finite Fields - 9th International Workshop, 2022
Proceedings of the 10th International Workshop on Signal Design and Its Applications in Communications, 2022
4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pq.
Proceedings of the IEEE International Symposium on Information Theory, 2022
Proceedings of the Cyberspace Safety and Security - 14th International Symposium, 2022
2021
2020
A kind of quaternary sequences of period 2p<sup>m</sup>q<sup>n</sup> and their linear complexity.
CoRR, 2020
Complex., 2020
On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p.
IEEE Access, 2020
Symmetric 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Period pq.
Proceedings of the Information Security and Cryptology - 16th International Conference, 2020
2019
On error linear complexity of new generalized cyclotomic binary sequences of period <i>p</i><sup>2</sup>.
Inf. Process. Lett., 2019
A further study of the linear complexity of new binary cyclotomic sequence of length p<sup>r</sup>.
Appl. Algebra Eng. Commun. Comput., 2019
2018
Linear Complexity of Quaternary Sequences over Z<sub>4</sub> Based on Ding-Helleseth Generalized Cyclotomic Classes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients.
Adv. Math. Commun., 2018
Proceedings of the Cloud Computing and Security - 4th International Conference, 2018
On k-error Linear Complexity of Zeng-Cai-Tang-Yang Generalized Cyclotomic Binary Sequences of Period p<sup>2</sup>.
Proceedings of the Frontiers in Cyber Security - First International Conference, 2018
2017
CoRR, 2017
Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes.
CoRR, 2017
On error linear complexity of new generalized cyclotomic binary sequences of period p<sup>2</sup>.
CoRR, 2017
2016
Linear Complexity of a Family of Pseudorandom Discrete Logarithm Threshold Sequences.
Int. J. Netw. Secur., 2016
Int. J. Comput. Math. Comput. Syst. Theory, 2016
Adv. Math. Commun., 2016
2015
On the k-error linear complexity of binary sequences derived from polynomial quotients.
Sci. China Inf. Sci., 2015
2014
Linear Complexity of Pseudorandom Sequences Derived from Polynomial Quotients: General Cases.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
2012
Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012
2011
J. Comput. Sci. Technol., 2011
2010
Construction of Large Families of Pseudorandom Subsets of the Set {1, 2, ..., N} Using Elliptic Curves.
Int. J. Netw. Secur., 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
IACR Cryptol. ePrint Arch., 2009