![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Chenhuang Wu
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j20]Jie Xiao, Hui Huang, Chenhuang Wu, Qunshan Chen, Zhenjie Huang
:
A collaborative auditing scheme with dynamic data updates based on blockchain. Connect. Sci. 35(1) (2023) - [j19]Zhixiong Chen
, Zhihua Niu
, Yuqi Sang
, Chenhuang Wu:
Arithmetic autocorrelation of binary m-sequences. Cryptologia 47(5): 449-458 (2023) - [j18]Zhiyao Yang
, Pinhui Ke, Zhixiong Chen, Chenhuang Wu:
Results on the Gowers U2 Norm of Generalized Boolean Functions. Int. J. Found. Comput. Sci. 34(4): 373-393 (2023) - 2022
- [j17]Zeng Wu, Hui Huang
, Yuping Zhou, Chenhuang Wu
:
A secure and efficient data deduplication framework for the internet of things via edge computing and blockchain. Connect. Sci. 34(1): 1999-2025 (2022) - [j16]Vladimir Edemskiy, Chenhuang Wu, Chunxiang Xu:
Improvements on k-error linear complexity of q-ary sequences derived from Euler quotients. Cryptologia 46(2): 148-166 (2022) - [j15]Xiaoyong Yan
, Jian Zhou, Haiping Huang, Chenhuang Wu
, Lijuan Sun
, Aiguo Song
:
A weighted range-free localization algorithm for irregular multihop networks. Int. J. Commun. Syst. 35(10) (2022) - 2020
- [j14]Chenhuang Wu
, Vladimir Edemskiy
, Chunxiang Xu
:
On k-Error Linear Complexity of Binary Sequences Derived From Euler Quotients Modulo 2p. IEEE Access 8: 51477-51481 (2020) - [j13]Qiuyan Wang
, Chenhuang Wu
, Minghui Yang, Yang Yan
:
A Kind of Quaternary Sequences of Period 2pmqn and Their Linear Complexity. Complex. 2020: 5129450:1-5129450:9 (2020) - 2019
- [j12]Zhifan Ye, Pinhui Ke, Chenhuang Wu:
A further study of the linear complexity of new binary cyclotomic sequence of length pr. Appl. Algebra Eng. Commun. Comput. 30(3): 217-231 (2019) - [j11]Chenhuang Wu
, Chunxiang Xu, Zhixiong Chen, Pinhui Ke
:
On error linear complexity of new generalized cyclotomic binary sequences of period p2. Inf. Process. Lett. 144: 9-15 (2019) - 2018
- [j10]Zhixiong Chen, Vladimir Edemskiy
, Pinhui Ke, Chenhuang Wu:
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. Adv. Math. Commun. 12(4): 805-816 (2018) - [j9]Xina Zhang, Xiaoni Du, Chenhuang Wu:
Linear Complexity of Quaternary Sequences over Z4 Based on Ding-Helleseth Generalized Cyclotomic Classes. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(5): 867-871 (2018) - 2016
- [j8]Xiaoni Du, Chenhuang Wu, Wanyin Wei:
An extension of binary threshold sequences from Fermat quotients. Adv. Math. Commun. 10(4): 743-752 (2016) - [j7]Chenhuang Wu:
Trace representation of cyclotomic generator of orderr. Int. J. Comput. Math. Comput. Syst. Theory 1(1): 3-13 (2016) - [j6]Chenhuang Wu, Xiaoni Du, Zhengtao Jiang:
Linear Complexity of a Family of Pseudorandom Discrete Logarithm Threshold Sequences. Int. J. Netw. Secur. 18(3): 487-492 (2016) - 2015
- [j5]Zhixiong Chen, Zhihua Niu, Chenhuang Wu:
On the k-error linear complexity of binary sequences derived from polynomial quotients. Sci. China Inf. Sci. 58(9): 1-15 (2015) - 2014
- [j4]Xiaoni Du, Ji Zhang, Chenhuang Wu:
Linear Complexity of Pseudorandom Sequences Derived from Polynomial Quotients: General Cases. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(4): 970-974 (2014) - 2012
- [j3]Chenhuang Wu, Zhixiong Chen, Xiaoni Du:
Binary Threshold Sequences Derived from Carmichael Quotients with Even Numbers Modulus. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 95-A(7): 1197-1199 (2012) - 2011
- [j2]Zhixiong Chen, Xiaoni Du, Chenhuang Wu:
Pseudo-Randomness of Certain Sequences of k Symbols with Length pq. J. Comput. Sci. Technol. 26(2): 276-282 (2011) - 2010
- [j1]Zhixiong Chen, Li Xu, Chenhuang Wu:
Construction of Large Families of Pseudorandom Subsets of the Set {1, 2, ..., N} Using Elliptic Curves. Int. J. Netw. Secur. 11(3): 149-154 (2010)
Conference and Workshop Papers
- 2022
- [c8]Jie Xiao, Hui Huang, Chenhuang Wu, Qunshan Chen, Zhenjie Huang
:
A Blockchain-Based Collaborative Auditing Scheme for Cloud Storage. CSS 2022: 147-159 - [c7]Vladimir Edemskiy
, Chenhuang Wu:
4-adic complexity of quaternary cyclotomic sequences and Ding-Helleseth sequences with period pq. ISIT 2022: 372-377 - [c6]Vladimir Edemskiy
, Chenhuang Wu, Sofia Koltsova, Meixiang Chen:
3-adic complexity of ternary sequences with period pq. IWSDA 2022: 1-5 - [c5]Vladimir Edemskiy
, Chenhuang Wu
:
Linear Complexity of Generalized Cyclotomic Sequences with Period pnqm. WAIFI 2022: 320-333 - 2020
- [c4]Vladimir Edemskiy
, Chenhuang Wu
:
Symmetric 2-Adic Complexity of Ding-Helleseth Generalized Cyclotomic Sequences of Period pq. Inscrypt 2020: 318-327 - 2018
- [c3]Chenhuang Wu, Chunxiang Xu:
On k-error Linear Complexity of Zeng-Cai-Tang-Yang Generalized Cyclotomic Binary Sequences of Period p2. FCS 2018: 9-22 - [c2]Liping Zhao, Xiaoni Du, Chenhuang Wu:
Trace Representation of the Sequences Derived from Polynomial Quotient. ICCCS (4) 2018: 26-37 - 2010
- [c1]Zhixiong Chen, Xiangguo Cheng, Chenhuang Wu:
A Family of Binary Threshold Sequences Constructed by Using the Multiplicative Inverse. Inscrypt 2010: 95-104
Informal and Other Publications
- 2021
- [i12]Huaning Liu, Zhixiong Chen, Chenhuang Wu:
Correlation measures of binary sequences derived from Euler quotients. CoRR abs/2109.04850 (2021) - [i11]Zhixiong Chen, Zhihua Niu, Yuqi Sang, Chenhuang Wu:
Arithmetic Autocorrelation of Binary m-Sequences. CoRR abs/2111.11176 (2021) - 2020
- [i10]Yang Yan, Qiuyan Wang, Chenhuang Wu:
Multisequences with high joint nonlinear complexity from function fields. CoRR abs/2001.10808 (2020) - [i9]Qiuyan Wang, Chenhuang Wu, Minghui Yang, Yang Yan:
A kind of quaternary sequences of period 2pmqn and their linear complexity. CoRR abs/2001.10839 (2020) - [i8]Qiuyan Wang, Yang Yan, Chenhuang Wu, Chun'e Zhao:
Asymptotically optimal codebooks derived from generalised bent functions. CoRR abs/2002.06376 (2020) - 2019
- [i7]Chenhuang Wu, Vladimir Edemskiy, Chunxiang Xu:
On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p. CoRR abs/1910.04607 (2019) - 2018
- [i6]Zhixiong Chen, Vladimir Edemskiy, Pinhui Ke, Chenhuang Wu:
On k-error linear complexity of pseudorandom binary sequences derived from Euler quotients. CoRR abs/1803.03339 (2018) - 2017
- [i5]Chenhuang Wu, Chunxiang Xu, Zhixiong Chen, Pinhui Ke:
On error linear complexity of new generalized cyclotomic binary sequences of period p2. CoRR abs/1711.06063 (2017) - [i4]Xina Zhang, Xiaoni Du, Chenhuang Wu:
Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes. CoRR abs/1711.08216 (2017) - [i3]Zhifan Ye, Pinhui Ke, Chenhuang Wu:
A note on a conjecture of new binary cyclotomic sequences of length pn. CoRR abs/1712.08886 (2017) - 2013
- [i2]Zhixiong Chen, Zhihua Niu, Chenhuang Wu:
On the $k$-error linear complexity of binary sequences derived from polynomial quotients. CoRR abs/1307.6626 (2013) - 2009
- [i1]Zhixiong Chen, Chenhuang Wu:
Construction of large families of pseudorandom subsets using elliptic curves. IACR Cryptol. ePrint Arch. 2009: 76 (2009)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-05-02 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint