Pseudo Random Number Generator Based on Back Propagation Neural Network

Random numbers play an increasingly important role in secure wire and wireless communication. Thus the design quality of random number generator(RNG) is significant in information security. A novel pseudo RNG is proposed for improving the security of network communication. The back propagation neural network(BPNN) is nonlinear, which can be used to improve the traditional RNG. The novel pseudo RNG is based on BPNN techniques. The result of test suites standardized by the U.S shows that the RNG can satisfy the security of communication.

Low Area PRESENT Cryptography in FPGA Using TRNG-PRNG Key Generation

Lightweight Cryptography(LWC)is widely used to provide integrity,secrecy and authentication for the sensitive applications.However,the LWC is vulnerable to various constraints such as high-power consumption,time consumption,and hardware utilization and susceptible to the malicious attackers.In order to overcome this,a lightweight block cipher namely PRESENT architecture is proposed to provide the security against malicious attacks.The True Random Number Generator-Pseudo Random Number Generator(TRNG-PRNG)based key generation is proposed to generate the unpredictable keys,being highly difficult to predict by the hackers.Moreover,the hardware utilization of PRESENT architecture is optimized using the Dual port Read Only Memory(DROM).The proposed PRESENT-TRNGPRNG architecture supports the 64-bit input with 80-bit of key value.The performance of the PRESENT-TRNG-PRNG architecture is evaluated by means of number of slice registers,flip flops,number of slices Look Up Table(LUT),number of logical elements,slices,bonded input/output block(IOB),frequency,power and delay.The input retrieval performances analyzed in this PRESENT-TRNG-PRNG architecture are Peak Signal to Noise Ratio(PSNR),Structural Similarity Index(SSIM)and Mean-Square Error(MSE).The PRESENT-TRNG-PRNG architecture is compared with three different existing PRESENT architectures such as PRESENT On-TheFly(PERSENT-OTF),PRESENT Self-Test Structure(PRESENT-STS)and PRESENT-Round Keys(PRESENT-RK).The operating frequency of the PRESENT-TRNG-PRNG is 612.208 MHz for Virtex 5,which is high as compared to the PRESENT-RK.

Deterministic Algorithm Computing All Generators: Application in Cryptographic Systems Design

Primitive elements play important roles in the Diffie-Hellman protocol for establishment of secret communication keys, in the design of the ElGamal cryptographic system and as generators of pseudo-random numbers. In general, a deterministic algorithm that searches for primitive elements is currently unknown. In information-hiding schemes, where a primitive element is the key factor, there is the freedom in selection of a modulus. This paper provides a fast deterministic algorithm, which computes every primitive element in modular arithmetic with special moduli. The algorithm requires at most O(log2p) digital operations for computation of a generator. In addition, the accelerated-descend algorithm that computes small generators is described in this paper. Several numeric examples and tables illustrate the algorithms and their properties.

THO-MAC:一种两跳优化的低延迟低功耗无线传感器网络介质访问控制协议

功耗与延迟是无线传感器网络介质访问控制协议设计首要考虑的两个问题。提出了一种新的传感器网络低延迟、低功耗、接收节点初始化异步介质访问控制协议——THO-MAC协议。通过准确预测接收节点的唤醒时间,THO-MAC协议调度发送节点侦听信道,从而减少发送节点空闲侦听能量浪费。THOMAC协议在发送节点两跳转发节点集中选择使报文两跳转发延迟最小的转发节点,从而降低报文传输延迟。使用NS2模拟器对THO-MAC协议进行了详细模拟。模拟结果显示,与RI-MAC和Any-MAC协议相比,THOMAC协议可以减少35.5%和18%的报文传输延迟,同时节省23.5%和15.5%的节点功耗。

基于PRNG的低成本RFID认证协议设计

低成本无线射频识别(RFID)的标签是被动式的,由于受成本和资源限制,系统不能提供公约加密、对称密钥加密、杂凑函数等。EPCglobal Class-1 Gen-2 RFID规范定义一种低成本的标签,仅提供PRNG和CRC操作。该文遵循EPCglobal Class—1 Gen-2 RFID规范,仅使用PRNG操作设计一个认证协议,实现双向认证、标签的匿名性和前向安全性。

一种基于2-by-n元胞自动机的高质量伪随机数发生器(英文)

为了满足密码学对高质量的随机序列的需求,提出一种新的基于2-by-n元胞自动机的伪随机数发生器。并着重于最大周期的要求,首先介绍了在细胞自动机中与之相关的机制,随后给出了基于2-by-nCA的二维梯形伪随机数发生器,详细说明了该发生器的规则及最大周期。最后使用该发生器产生用于测试的伪随机序列。计算机模拟表明,提出的二维梯形伪随机序列发生器产生的伪随机序列完全可以通过FIPS 140-2测试标准,证明该发生器具有良好的统计特性,完全可以应用于密码学领域。

A New Approach for the DFT NIST Test Applicable for Non-Stationary Input Sequences

The National Institute of Standards and Technology (NIST) document is a list of fifteen tests for estimating the probability of signal randomness degree. Test number six in the NIST document is the Discrete Fourier Transform (DFT) test suitable for stationary incoming sequences. But, for cases where the input sequence is not stationary, the DFT test provides inaccurate results. For these cases, test number seven and eight (the Non-overlapping Template Matching Test and the Overlapping Template Matching Test) of the NIST document were designed to classify those non-stationary sequences. But, even with test number seven and eight of the NIST document, the results are not always accurate. Thus, the NIST test does not give a proper answer for the non-stationary input sequence case. In this paper, we offer a new algorithm or test, which may replace the NIST tests number six, seven and eight. The proposed test is applicable also for non-stationary sequences and supplies more accurate results than the existing tests (NIST tests number six, seven and eight), for non-stationary sequences. The new proposed test is based on the Wigner function and on the Generalized Gaussian Distribution (GGD). In addition, this new proposed algorithm alarms and indicates on suspicious places of cyclic sections in the tested sequence. Thus, it gives us the option to repair or to remove the suspicious places of cyclic sections (this part is beyond the scope of this paper), so that after that, the repaired or the shortened sequence (original sequence with removed sections) will result as a sequence with high probability of random degree.

离散均匀分布随机SVPWM中伪随机数序列的表征与选择

采用随机的脉宽调制策略存在随机因子与输出电压功率谱之间关系不明确的问题。通过对随机位置SVPWM和随机周期SVPWM选用的伪随机数序列所服从的概率分布进行分析,利用随机过程理论建立该序列中概率参数和频域上谐波分布的联系。同时,推导服从离散均匀分布的伪随机数序列的功率谱数学表达,揭示功率谱与伪随机数序列之间的内在联系。提出应用梅森旋转算法来构造伪随机数生成器,改善传统线性反馈移位寄存器循环周期短、随机性差等缺陷。通过仿真和实验对比不同伪随机数生成器对功率谱中开关频率及其倍数处离散谐波能量的分散效果。结果验证所提出的方法和理论分析的正确性,为研究随机SVPWM对改善功率变换器中噪声和振动问题提供了参考。

基于HD Wallet与RC4技术的伪随机数生成和验证方案

为了完善区块链技术中的伪随机数机制,基于密码学原理和区块链分层确定性钱包技术(Hierarchical deterministic wallet,HD wallet)设计了一种新型伪随机数生成器,并采用HD wallet与(Rivest Cipher 4,RC4)技术实现。首先,更新钱包公钥并作Hash运算;其次,利用得出的散列值以异或的形式对RC4算法的内部状态进行置换;最后,将RC4与公钥的Hash运算之和作为生成的伪随机数。通过雪崩测试和NIST发行的随机性测试包对生成的伪随机数序列进行统计测试,实验结果表明,该方案可以安全可靠地生成伪随机数序列,且生成的伪随机数具有不可预测性、适用性和可验证性,可应用于区块链的钱包终端和信息安全等领域。

Asymptotics in addition of pseudo-random sequences

The performance of individual pseudo-random sequence, generated by some mechanism, is often not ideal. The asymptotic performance of the addition (in the sense (mod p) of a large number of such individual sequences is studied and the necessary and sufficient condition under which the resulting sequence may converge to genuine randomness is obtained.

一维鲁棒混沌映射及S盒的设计

本文利用Li-York混沌判别定理,构造了一类分段线性连续混沌映射.基于此类映射,建立了一个构造一类分段非线性鲁棒混沌映射的判别定理.作为应用,构造了一个由多项式函数和三角函数映射合成的分段非线性鲁棒混沌映射.通过计算该混沌映射的分岔图,验证了映射在参数范围内的混沌性.作为鲁棒混沌的应用,设计了三个基于分段非线性鲁棒混沌映射的伪随机数发生器.在此基础上,利用混沌映射对初始参数的敏感性,提出了批量生成S盒的算法.S盒密码性能的分析结果表明,生成的S盒具有良好的密码学性能,可以较好的抵抗线性与差分攻击,为密码算法的研究发展提供基础与条件.

一种二进制数字指纹编码算法

抗合谋攻击是数字指纹技术中需要解决的关键问题之一.基于二进制随机编码,通过使用伪随机序列对指纹比特的重复嵌入进行控制,提出了一种有效的抗合谋攻击的数字指纹编码算法及其相应的跟踪算法.理论分析和实验结果表明,在适当的合谋尺寸下,该算法能够对非法分发者进行有效跟踪,同时无辜用户被诬陷的概率可以根据要求接近于0.由于在该算法中发行商无须知道用户原来的码字,因此可以说该算法是设计非对称指纹的一个很好的备选算法.

基于混沌映射的伪随机序列发生器

提出了一种基于线性分段混沌映射(PWLCM)的收缩式伪随机序列发生器。针对分段线性混沌映射"逐段线性"的缺点,提出一种新的混沌轨迹比特位提取算法。该算法使用具有最长周期的线性移位寄存器(m-LFSR)所产生的序列来控制混沌轨道比特位的提取,从而有效避免混沌轨道泄露造成的安全性问题。分析表明,该发生器具有良好的密码学特性。

伪随机数发生器的FPGA实现与研究

在很多实际应用中,直接利用FPGA产生伪随机序列的方法可以为系统设计或测试带来极大的便利。本文给出了基于线性反馈移位寄存器电路,并结合FPGA的特有结构,设计了一种简捷而又高效的伪随机序列产生方法。最后通过统计对比,说明了这种方法所产生的随机序列不仅可具有极长的周期,而且还具有良好的随机特性。

基于一维扩展元胞自动机的伪随机数发生器研究

随机数作为加密数据的载体,备受关注,自然,随机数发生器亦成为密码学的重要研究课题之一。依据元胞自动机(CA)的基本理论,构造出一维扩展元胞自动机模型,借以生成随机数发生器的元胞自动机规则,同时引进遗传算法(GA),以元胞状态序列的熵作为遗传演化的适应度,从而有效地实现最佳元胞自动机规则的搜索,即构造出特定初始条件下的最优GA-CA耦合随机数发生器。最后对其生成随机数性能进行统计检验,其结果通过美国联邦信息处理标准(FIPS140-2)。为网络安全应用提供一种新的、特别适合硬件实现的、简单快速的伪随机数发生器。

高速伪随机数发生器的设计与实现

该文以物理噪声源和LFSR为基础,利用FPGA设计了一款高速伪随机数发生器DPFSR。这款高速伪随机数发生器既能满足密码学领域对随机数的高质量的要求,又能满足实际应用对随机数的高速度的要求,输出速率能达到上千兆bps。该文介绍了DPFSR的设计原理、安全性分析、设计参数并且给出了随机性测试结果。

八维广义同步系统在伪随机数发生器中的应用

该文提出一类4维离散系统。利用系统平衡点处Jacobi矩阵的特征值来分析系统在平衡点处的稳定性,建立了一个判别这类系统为周期或混沌的定理。依据该定理构造了一个新的4维离散系统。该系统具有正的Lyapunov指数,数值模拟显示该系统的动力学行为具有混沌特性。结合该系统和系统广义同步定理构造了一个8维广义同步混沌系统。利用该系统构造了一个16 bit混沌伪随机数发生器(CPRNG),其密钥空间大于21245。利用FIPS 140-2检测/广义FIPS 140-2检测判别标准分别检测由CPRNG,Narendra RBG,RC4 PRNG和ZUC PRNG生成的1000个长度为20000 bit的密钥流的随机性。检测结果表明,分别有100%/99%,100%/82.9%,99.9%/98.8%和100%/97.9%密钥流通过FIPS 140-2检测/广义FIPS 140-2检测标准。数值仿真显示不同密钥流之间有平均50.004%不同码。结果说明设计的伪随机数发生器有好的随机性,可以抵抗穷尽攻击。该文提出的CPRNG为密码安全的研究与发展提供了新的工具。

基于单向函数的伪随机数发生器

伪随机数发生器(pseudorandom number generator,PRNG)是重要的密码学概念.基于单向函数的伪随机数发生器起始于1982年的BMY发生器,将单向函数反复迭代,周期性地输出伪随机序列.单向函数的性质和种子长度关系到发生器的可实现性和安全性,是此类发生器的2个重要参数.在分析现有工作的基础上,改进了单向函数的随机化迭代方式,基于不可逆性证明了迭代过程的安全性.迭代方式的改进消除了单向函数的长度保持性质,采用一般的压缩规范单向函数和通用散列函数构建伪随机数发生器.输出级与BMY发生器结构类似,以迭代函数的核心断言作为伪随机序列.基于与真随机序列的不可区分性,证明了伪随机数发生器的安全性.所构建的伪随机数发生器与现有同类发生器结构类似,但放松了对单向函数性质的要求,增强了可实现性,减小了种子长度,提高了效率.

图像隐写分析现状研究

随着现代隐写术的发展,隐写分析成为信息安全领域一个新的研究热点。对图像隐写分析研究现状进行分析与综述,针对当前隐写分析技术的分类,阐述了隐写分析目的及概念,并重点分析几种常用统计隐写分析算法的原理、适用范围和面临的问题。最后,指出结合各种隐写分析算法,相互取长补短才是今后图像隐写分析发展的方向。

二维新混沌系统和伪随机数生成器的设计

为设计性能较好的伪随机数发生器,提出了一个满足修正的马罗驼(Marotto)定理的新二维离散混沌系统(2DCS)。利用离散广义混沌同步理论和2D-CS构造了一个广义同步混沌系统(2D-GCS);通过一个实数域到整数域的变换设计了一个混沌伪随机数生成器(CPRNG);利用美国联邦信息处理标准(federal information processing standards,FIPS)提出的FIPS 140-2检测包分别对CPRNG和RC4算法产生的1000个二进制序列的随机性进行检测,结果均通过了检测。检测结果的平均值和方差对比表明CPRNG和RC4算法产生的伪随机序列随机性能相当,相关性检测结果表明该CPRNG在不同的密钥扰动下产生的密钥各组序列几乎完全独立,设计的CPRNG能产生性能良好的伪随机数。