134 citations
- University of Science and Technology of ChinaCN14 papers
- Beijing Normal UniversityCN8 papers
- Kavli Institute for Theoretical SciencesCN8 papers
- University of Chinese Academy of SciencesCN8 papers
- Taiyuan University of TechnologyCN7 papers
- Hangzhou Dianzi UniversityCN6 papers
- Anhui University of Science and TechnologyCN4 papers
- Huazhong University of Science and TechnologyCN4 papers
- Anhui Science and Technology UniversityCN3 papers
- Australian National UniversityAU3 papers
- Chinese Academy of SciencesCN3 papers
- Curtin UniversityAU3 papers
6 papers · 1 filter
A Unified View of IoT And CPS Security and Privacy
Lan Luo, Christopher Morales-Gonzalez, Shan Wang +2
The concepts of Internet of Things (IoT) and Cyber Physical Systems (CPS) are closely related to each other. IoT is often used to refer to small interconnected devices like those i…
Structure Analysis on the -error Linear Complexity for -periodic Binary Sequences
Jianqin Zhou, Wanquan Liu, Xifeng Wang
In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for -periodic binary sequences, we first propose a decomposition based on the cub…
Characterization of -periodic binary sequences with fixed 3-error or 4-error linear complexity
Jianqin Zhou, Jun Liu, Wanquan Liu
The linear complexity and the -error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift regi…
The -error linear complexity distribution for -periodic binary sequences
Jianqin Zhou, Wanquan Liu
The linear complexity and the -error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift regi…
Generalized partially bent functions
Jianqin Zhou
Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z…
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
Jianqin Zhou, Xirong Xu
The union cost is used, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2pn over GF(q) is presented, where p and q are odd prim…