共查询到18条相似文献,搜索用时 234 毫秒
1.
2.
序列设计在信息安全,无线通信等诸多领域中有着重要应用。在流密码系统中,要求产生的随机序列具有理想的随机复杂度度量如线性复杂度,k阶相关复杂度等。其中Legendre序列具有这些理想的随机性质。实用中序列的生成速度也是很重要的考虑因素。探讨了大素数周期的Legendre序列生成的相关算法,并运用统一计算设备架构平台(CUDA)对其进行优化以加快序列的生成速度。实验结果表明,运用CUDA进行序列的并行生成,序列的生成速度有数量级的提高。 相似文献
3.
Fq上具有极大1-error线性复杂度的周期序列 总被引:1,自引:0,他引:1
线性复杂度是衡量序列密码学强度的重要指标,设计具有大的线性复杂度和k-error线性复杂度的序列是密码学和通信中的热点问题.Niederreiter首次发现了Fq上许多满足这个要求的周期序列.通过序列的广义离散傅立叶变换构造了一些Fq上具有极大1-error线性复杂度的周期序列,这些结果远远优于已知的结果. 相似文献
4.
5.
6.
7.
P元周期多序列及其广义对偶多序列的复杂性分析* 总被引:1,自引:1,他引:0
在提出P元周期多序列广义对偶多序列定义的基础上,讨论了P元周期多序列及其广义对偶多序列极小多项式之间的关系,研究了它们联合线性复杂度的性质。这些结果对研究流密码密钥流序列的联合线性复杂度有一定的应用价值。 相似文献
8.
9.
10.
11.
利用环 上广义Kerdock码的最高权位生成了一类p元最高权位序列,并对其密码特性进行研究。给出序列线性复杂度的准确计算公式,利用Galois环上的Weil指数和估计对序列的互相关性及非同步自相关性进行刻画。实验结果表明,构造的最高权位序列具有大的线性复杂度和极低的互相关性及非同步自相关性,可作为CDMA通信系统中的码序列。 相似文献
12.
利用环Zp^2上广义Kerdock码的最高权位生成了一类p元最高权位序列,并对其密码特性进行研究。给出序列线性复杂度的准确计算公式,利用Galois环上的Weil指数和估计对序列的互相关性及非同步自相关性进行刻画。实验结果表明,构造的最高权位序列具有大的线性复杂度和极低的互相关性及非同步自相关性,可作为CDMA通信系统中的码序列。 相似文献
13.
The well-known binary Legendre sequences possess good autocorrelation functions and high linear complexity, and are just special cases of much larger families of cyclotomic sequences. Prime-square sequences are the generalization of these Legendre sequences, but the ratio of the linear complexity to the least period of these sequences approximates to zero if the prime is infinite. However, a relatively straightforward modification can radically improve this situation. The structure and properties, including linear complexity, minimal polynomial, and autocorrelation function, of these modified prime-square sequences are investigated. The hardware implementation is also considered. 相似文献
14.
15.
This paper contributes to trace representation of some generalized cyclotomic sequences of length which are defined by Ding and Helleseth. From the relations between these sequences and the Legendre sequence, we firstly confirm the defining pairs of these sequences of arbitrary order. Then, we obtain their trace representation, from which we give their linear complexity using Key’s method. It can be seen that Bai et al.’s conclusion is a special case of our result when the order is two. Finally, an example is given to illustrate the validity of our result. 相似文献
16.
CHEN ZhiXiong 《中国科学:信息科学(英文版)》2014,(11):116-125
We describe the trace representations of two families of binary sequences derived from the Fermat quotients modulo an odd prime p (one is the binary threshold sequences and the other is the Legendre Fermat quotient sequences) by determining the defining pairs of all binary characteristic sequences of cosets, which coincide with the sets of pre-images modulo p2 of each fixed value of Fermat quotients. From the defining pairs, we can obtain an earlier result of linear complexity for the binary threshold sequences and a new result of linear complexity for the Legendre Fermat quotient sequences under the assumption of 2p-1≠ 1 mod p2. 相似文献
17.
This paper presents a new method for the parameter identification of linear time-invariant discrete systems with single input and single output. Using a well-constructed transformation matrix, the input and output data sequences are first transformed into discrete Legendre spectrum sequences. Performing the spectrum matching process, the parameter identification problem becomes the solution of a set of overdetermined linear algebraic equations. Examples are given to demonstrate the accuracy of the new method. 相似文献
18.
ZHANG Li-Ping YANG Fu-Wen 《自动化学报》2005,(2)
An iterative learning control algorithm based on shifted Legendre orthogonal polynomials is proposed to address the terminal control problem of linear time-varying systems. First, the method parameterizes a linear time-varying system by using shifted Legendre polynomials approximation. Then, an approximated model for the linear time-varying system is deduced by employing the orthogonality relations and boundary values of shifted Legendre polynomials. Based on the model, the shifted Legendre polynomials coefficients of control function are iteratively adjusted by an optimal iterative learning law derived. The algorithm presented can avoid solving the state transfer matrix of linear time-varying systems. Simulation results illustrate the effectiveness of the proposed method. 相似文献