Analysis and design of stream ciphers
Analysis and design of stream ciphers
On the linear complexity profile of the power generator
IEEE Transactions on Information Theory
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)
IEEE Transactions on Information Theory
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
IEEE Transactions on Information Theory
Linear complexity over Fp and trace representation of Lempel-Cohn-Eastman sequences
IEEE Transactions on Information Theory
On the linear complexity of nonlinearly filtered PN-sequences
IEEE Transactions on Information Theory
Results on the nonlinear span of binary sequences
IEEE Transactions on Information Theory
A novel family of frequency hopping sequences for multi-hop Bluetooth networks
IEEE Transactions on Consumer Electronics
| Hi-index | 0.00 |
High complexity of frequency-hopping (FH)/spread-spectrum (SS) sequence is of great importance to high-security multiple-access communication systems, for it makes FH/SS sequence difficult to be analyzed. With the growing development in the design of FH/SS sequence in much wider fields, the well-known complexity measures--the linear complexity (LC), the linear complexity profile (LCP) and the k-error linear complexity (k-error LC)--are widely used but not sufficient to evaluate the complexities of the sequences available, such as the cryptographical sequence and the chaotic sequence families. In this paper, a new complexity metric to evaluate the unpredictability of FH/SS sequence based on the approximate entropy (ApEn) is proposed in the view of the maximal randomness of the sequences with arbitrary length. And the theoretical bounds of the ApEn are derived from a probabilistic point of view. Simulations and analysis results show that, the proposed ApEn works effectively to discern the changing complexities of the FH/SS sequences with small number of samples, which provide superior performance over its candidates.