欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
Brandst？tter等人（2011）结合割圆序列与Sidel’nikov序列的概念定义了一个新序列双素数（p,q） Sidel’nikov序列，并且分析了双素数Sidel’nikov序列的均衡性、自相关函数、相关测度和线性复杂度轮廓，证明了双素数Sidel’nikov序列有好的伪随机特性。该文主要研究d=gcd（p, q）=2的双素数Sidel’nikov序列的自相关函数，借助于数论中的Legendre符号和有限域中的指数和理论，得到自相关函数的3个定理。通过与Brandst？tter论文中自相关函数的界进行比较，本文定理2和定理3中的界O（q1/2）和O（p1/2）比Brandst？tter的界O（（p＋q）/2）更紧，同时当p〉〉q或q〉〉p时，本文定理4中的界O（（p q）1/2）比Brandst？tter的界O（（p＋q）/2＋（p q）1/2）更优。
英文摘要：
Brandst？tter et al. （2011） combined the concepts of the two-prime generator and Sidel’nikov sequence to define a new sequence called two-prime （p, q） Sidel’nikov sequence, and analyzed the balance, the autocorrelation, the correlation measure and the linear complexity profile of the sequence. They showed that this sequence has many nice pseudorandom properties. With the help of the Legendre symbol in number theory and the exponential sums in finite field, this paper investigates the autocorrelation of the two-prime Sidel’nikov sequence with d=gcd（p, q）=2. Three theorems are got about the autocorrelation functions. The detailed comparison results show that the bounds O（q1/2） and O（p1/2） on the autocorrelation function in theorem 2 and theorem 3 are tighter than the Brandst？tter’s bound O（（p＋q）/2）, besides, the bound O（（p q） 1/2） in theorem 4 are tighter than the Brandst？tter’s bound O（（p＋q）/2＋（p q） 1/2） when p〉〉q or q〉〉p.
同期刊论文项目
同项目期刊论文
On the affine equivalence relation between two classes of Boolean functions with optimal algebraic i
On the distinctness of binary sequences derived from primitive sequences modulo square-free odd inte
期刊信息
位置：