东篱科研大数据发现系统（DRDS）

位置：成果数据库 > 期刊 > 期刊详情页

Fp上p^n-周期序列的k-错误序列

ISSN号：1000-436X
期刊名称：《通信学报》
时间：0
分类：TN918.1[电子电信—通信与信息系统;电子电信—信息与通信工程]
作者机构：[1]解放军信息工程大学信息工程学院,河南郑州450002
相关基金：国家自然科学基金资助项目（60673081）; 国家高技术发展计划（“863”计划）基金资助项目（2006AA01Z417）~~

关键词：序列密码, 线性复杂度, k-错误线性复杂度, k-错误序列, stream cipher, linear complexity, k-error linear complexity, k-error sequences

中文摘要：

一些特殊的序列如Legendre序列,Sidelnikov序列等,近年来把它们看成Fp上周期序列并对其k-错误线性复杂度进行研究得到了广泛的关注,利用广义的Games-Chan算法,确定了Fp上p^n-周期序列1-错误序列的个数,讨论了Fp上p^n-周期序列的2-错误序列的个数,并且给出了Fp上p^n-周期序列1-错误序列个数的均值,这里p为奇素数。

英文摘要：

Some special sequences such as Legendre sequences and Sidelnikov sequences is treated as periodic sequences and its k-error linear complexity is widely researched in recent years.With extented Games-Chan algorithm,the number of 1-error sequences of pn-periodic sequences over Fp was given,and the number of 2-error sequences was discussed too;Further more,the expected value of the number of 1-error sequences of pn-periodic sequences over Fp was also shown,here p was an odd prime.

同期刊论文项目

环上本原序列模2压缩映射及其导出序列分析

期刊论文 39 会议论文 3

　基于环上序列的新型流密码设计

期刊论文 13

同项目期刊论文

A note on the crosscorrelation of maximal length FCSR sequences

Distribution properties of compressing sequences derived from primitive s equences over Z/(p e )

On the construction of Boolean functions with optimal algebraic immunity

The 2-error linear complexity of 2n-periodic binary sequences

私钥p, q 共享低位比特RSA体制的小指数攻击

2mpn周期二元序列的线性复杂度和k-错线性复杂度

A note about the cyclotomic polynomial Φpq(x) and some related results

Klimov-Shamir T-函数的代数结构

F2上2n-周期序列的k-错误序列

On the distinctness of modular reductions of maximal length sequences modulo odd prime powers

Linearity properties of binary FCSR sequences

On the distinctness of maximal length sequences over Z/(pq) modulo 2

Autocorrelation and distinctness of decimations of l-sequences based on primes

Period and complementarity properties of FCSR memory sequences

Boolean function of an odd number of variables with maximum algebraic immunity

Injective maps on primitive sequences over Z/(pe)

Fp上pn-周期序列的1-错线性复杂度

A large class of binary ZCZ sequence families constructed by period doubling

Autocorrelations of l-sequences with certain shifts

The 2-error linear complexity of 2n-periodic binary sequences with linear complexity 2n - 1

Uniqueness of the distribution of zeroes of primitive level sequences over Z/(pe) (II)

Injectivity of compressing maps on primitive sequences over Z/(pe)

Further result of compressing maps on primitive sequences modulo odd prime powers

一种高效短群签名的批验证

基于单圈T-函数序列的pattern分布

平衡收缩序列的安全性分析

高非线性度向量弹性函数

环Z／（2^e）上压缩序列ae-1＋η（a0,a1,…,ae-2）的局部保熵性

Fp上p^n-周期序列的1-错线性复杂度

A LARGE CLASS OF BINARY ZCZ SEQUENCE FAMILIES CONSTRUCTED BY PERIOD DOUBLING

INJECTIVE MAPS ON PRIMITIVE SEQUENCES OVER Z/（p^e）

具有强安全性的不含双线性对的无证书签名方案

A note about the cyclotomic polynomial Фpq（x） and some related results

短群签名的高效批验证

两种无证书签密方案的安全性分析

单圈T-函数导出的de Bruijn序列