共查询到19条相似文献,搜索用时 187 毫秒
1.
2.
3.
4.
第一类m子序列的构造 总被引:3,自引:0,他引:3
伪随机序列在流密码、信道编码、扩频通信等领域有着广泛的应用,m序列是优秀的伪随机序列.基于m序列,本文首次提出通过重构m序列移位寄存器状态图,构造一类称之为m子序列的移位寄存器状态图.根据重构的状态图,提出了第一类m子序列并予以证明.本文推导了第一类m子序列移位寄存器反馈函数式,分析了第一类m子序列具有良好的周期特性、游程特性、平衡特性以及较高的线性复杂度.仿真结果表明,m子序列自相关特性也具有很好的δ(t)函数特征.利用文中给出的构造方法,可以构造更多性能优良的m子序列. 相似文献
5.
2011年Braverman等人在伪随机函数的概念上提出了自适应泄漏弹性的伪熵函数.针对该方案抗泄漏量一定的问题,文中对该方案进行改进,基于合数剩余假提出新的构建方案.从证明结果可以看出,新方案具有更高的抗泄漏量. 相似文献
6.
为产生随机性能良好的伪随机序列,提出了一个新的变结构混沌系统。该混沌系统在一个开关函数控制下其系统结构随时间随机地转换,所产生的混沌信号是两个不同的混沌信号的混合,具有良好的复杂性。基于该变结构混沌系统设计了一种伪随机序列发生器,采用NIST标准和STS-2.0b测试套件对其产生的伪随机序列进行了统计性能测试,测试结果表明该伪随机序列发生器具有良好的随机性,可应用于计算机、通信、信息加密等领域中。 相似文献
7.
8.
一种基于模糊熵的混沌伪随机序列复杂度分析方法 总被引:2,自引:1,他引:1
该文将模糊理论引入到混沌伪随机序列复杂度测度中,构造了用于序列复杂度测度的模糊隶属函数,并在此基础上研究了一种新的基于模糊熵(Fuzzy Entropy, FuzzyEn)的混沌伪随机序列复杂度测度。仿真结果表明,与现有主要的混沌伪随机序列复杂度测度方法相比较,FuzzyEn测度不仅能够有效地测度出不同复杂度的混沌伪随机序列,而且具有更加好的对序列符号空间的适用性,更加小的对测量维度的敏感性以及更强的对分辨率的鲁棒性。 相似文献
9.
针对非线性最大长度移位寄存器反馈函数难以构造问题,本文提出了一种基于母函数构造非线性最大长度移位寄存器反馈函数方法.首先,我们阐述了母函数模3分类法,证明了各类母函数新的特征状态集,提取了母函数的特征式;其次,根据特征式对母函数的筛分特性合成了非线性m子序列移位寄存器反馈函数;最后,分析了该移位寄存器生成的伪随机序列,对其自相关值和线性复杂度进行了大量搜索.结果一致表明该序列不仅具有良好的周期特性、平衡特性、游程特性,还具有尖锐的自相关特性和理想的线性复杂度. 相似文献
10.
伪随机三元阵列偶理论研究 总被引:1,自引:0,他引:1
文中提出了一种新的具有良好循环相关特性的离散信号,即伪随机三元阵列偶。首先给出了伪随机三元阵列偶的相关定义;然后研究了伪随机三元阵列偶的变换性质和频谱特性;而且,为了减小搜索范围,提高搜索效率,给出了伪随机三元阵列偶存在的必要条件;最后证明了伪随机三元阵列偶的唯一性,并给出了一种构造伪随机三元阵列偶的方法。 相似文献
11.
为了优化Luby和Rackoff给出的DES型置换的构造,我们给出了一种基于循环移位置换的超伪随机置换的构造方法。新构造简化了构造的复杂性和基于随机预言模型的安全性证明,并指出:首末两轮循环移位置换和中间两轮DES-型的随机置换的组合构造是超伪随机置换。新构造降低了区分优势的上界和敌手攻击成功的概率并降低了对首末轮函数的要求。 相似文献
12.
Knudsen 《Journal of Cryptology》2008,15(3):207-222
This paper considers the security of Feistel networks where the round functions are chosen at random from a family of 2
k
randomly chosen functions for any k . Also considered are the networks where the round functions are themselves permutations, since these have applications in
practice. The constructions are attacked under the assumption that a key-recovery attack on one round function itself requires
an exhaustive search over all 2
k
possible functions. Attacks are given on all three-, four-, five-, and six-round Feistel constructions and interesting bounds
on their security level are obtained. In a chosen text scenario the key recovery attacks on the four-round constructions,
the analogue to the super pseudorandom permutations in the Luby and Rackoff model, take roughly only the time of an exhaustive
search for the key of one round. A side result of the presented attacks is that some constructions, which have been proved
super pseudorandom in the model of Luby and Rackoff, do not seem to offer more security in our model than constructions which
are not super pseudorandom. 相似文献
13.
提出了一个标准模型下基于因子分解问题的短签名方案。方案利用了从弱安全签名到标准安全签名的通用构造和变色龙散列函数,其签名只包含一个Z N*上的元素,公钥长度也很短,只包含模N、Z N*上的一个元素、一个整数和一个伪随机函数的种子。和Hohenberger的RSA方案相比,所提方案的计算代价小很多。 相似文献
14.
Luby and Rackoff [26] showed a method for constructing a pseudorandom permutation from a pseudorandom function. The method
is based on composing four (or three for weakened security) so-called Feistel permutations, each of which requires the evaluation
of a pseudorandom function. We reduce somewhat the complexity of the construction and simplify its proof of security by showing
that two Feistel permutations are sufficient together with initial and final pairwise independent permutations. The revised
construction and proof provide a framework in which similar constructions may be brought up and their security can be easily
proved. We demonstrate this by presenting some additional adjustments of the construction that achieve the following:
• Reduce the success probability of the adversary.
• Provide a construction of pseudorandom permutations with large input-length using pseudorandom functions with small input-length.
Received 2 August 1996 and revised 26 July 1997 相似文献
15.
16.
Liming Wang Fow-Sen Choa Jye-Hong Chen Yanjie Chai Mei-Hao Shih 《Lightwave Technology, Journal of》1999,17(10):1724-1731
Low-cost simple structure integrated transceivers are the key components toward future applications of coherent technology in access networks. In this paper, we propose a novel counterreceiving heterodyne detection (CRHD) scheme of a monolithically integrated four-section coherent transceiver. The CRHD scheme can lead to further simplification of the design of integrated coherent transceivers, and facilitates duplex transmissions with a single terminal device. Error free detection at 100 Mb/s with a 215-1 pseudorandom pattern is achieved. Flexible partitioning of channel capacity between the up- and downstream traffic on the same wavelength channel is proposed and demonstrated based on the CRHD scheme. The functions of signaling and multichannel operations are performed to demonstrate a proof-of-concept bandwidth-on-demand access network with integrated coherent transceivers 相似文献
17.
针对变换域通信系统对随机相位随机性与相关性的要求,提出了一种采用混沌映射m序列控制法的基函数相位映射方法,相比于传统一维m序列产生基函数,该方法所产生基函数的随机性提高了N倍(N为m序列的长度);同时由于采用混沌映射,产生了大量互相关系数很小的基函数,具有更加良好的相关性。仿真结果表明,采用混沌映射m序列控制法的基函数相位映射方法,提高了基函数的相关性,有效地降低了系统的误码率。 相似文献
18.
基于周期为2m-1的二元伪随机序列,利用交织法构造了一类满足一定条件的周期为2m+1-1的基序列集,进而利用这些基序列集构造得到了一类参数达到Tang-Fan-Matsufuji界的二元最佳低相关区序列集。这类低相关区序列集具有更多的序列数目,应用到准同步CDMA系统可以支持更多的用户。 相似文献
19.
Greshishchev Y.M. Schvan P. Showell J.L. Mu-Liang Xu Ojha J.J. Rogers J.E. 《Solid-State Circuits, IEEE Journal of》2000,35(12):1949-1957
A silicon germanium (SiGe) receiver IC is presented here which integrates most of the 10-Gb/s SONET receiver functions. The receiver combines an automatic gain control and clock and data recovery circuit (CDR) with a binary-type phase-locked loop, 1:8 demultiplexer, and a 2 7-1 pseudorandom bit sequence generator for self-testing. This work demonstrates a higher level of integration compared to other silicon designs as well as a CDR with SONET-compliant jitter characteristics. The receiver has a die size of 4.5×4.5 mm2 and consumes 4.5 W from -5 V 相似文献