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 propo...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.展开更多
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 consu...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.展开更多
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 g...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.展开更多
The National Institute of Standards and Technology (NIST) document is a list of fifteen tests for estimating the probability of signal randomness degree. <span style="font-family:Verdana;">Test number ...The National Institute of Standards and Technology (NIST) document is a list of fifteen tests for estimating the probability of signal randomness degree. <span style="font-family:Verdana;">Test number six in the NIST document is the Discrete Fourier Transform</span><span style="font-family:Verdana;"> (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 </span><span style="font-family:Verdana;">or test, which may replace the NIST tests number six, seven and eight. The</span> <span style="font-family:Verdana;">proposed test is applicable also for non-stationary sequences and supplies</span><span style="font-family:Verdana;"> more </span><span style="font-family:Verdana;">accurate results than the existing tests (NIST tests number six, seven and</span><span style="font-family:Verdana;"> eight), for non-stationary sequences. The new proposed test is based on the Wigner function and on the Generalized Gaussian Distribution (GGD). In addition, </span><span style="font-family:Verdana;">this new proposed algorithm alarms and indicates on suspicious places of</span><span style="font-family:Verdana;"> cyclic </span><span style="font-family:Verdana;">sections in the tested sequence. Thus, it gives us the option to repair or to</span><span style="font-family:Verdana;"> remove the suspicious places of cyclic sections</span><span><span><span><span></span><span></span><b><span style="font-family:;" "=""><span></span><span></span> </span></b></span></span></span><span><span><span><span></span><span></span><span style="font-family:;" "=""><span></span><span></span><span style="font-family:Verdana;">(this part is beyond the scope </span><span style="font-family:Verdana;">of this paper), so that after that, the repaired or the shortened sequence</span><span style="font-family:Verdana;"> (origi</span><span style="font-family:Verdana;">nal sequence with removed sections) will result as a sequence with high</span><span style="font-family:Verdana;"> probability of random degree.</span></span></span></span></span>展开更多
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...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.展开更多
伪随机数发生器(pseudorandom number generator,PRNG)是重要的密码学概念.基于单向函数的伪随机数发生器起始于1982年的BMY发生器,将单向函数反复迭代,周期性地输出伪随机序列.单向函数的性质和种子长度关系到发生器的可实现性和安全性...伪随机数发生器(pseudorandom number generator,PRNG)是重要的密码学概念.基于单向函数的伪随机数发生器起始于1982年的BMY发生器,将单向函数反复迭代,周期性地输出伪随机序列.单向函数的性质和种子长度关系到发生器的可实现性和安全性,是此类发生器的2个重要参数.在分析现有工作的基础上,改进了单向函数的随机化迭代方式,基于不可逆性证明了迭代过程的安全性.迭代方式的改进消除了单向函数的长度保持性质,采用一般的压缩规范单向函数和通用散列函数构建伪随机数发生器.输出级与BMY发生器结构类似,以迭代函数的核心断言作为伪随机序列.基于与真随机序列的不可区分性,证明了伪随机数发生器的安全性.所构建的伪随机数发生器与现有同类发生器结构类似,但放松了对单向函数性质的要求,增强了可实现性,减小了种子长度,提高了效率.展开更多
为设计性能较好的伪随机数发生器,提出了一个满足修正的马罗驼(Marotto)定理的新二维离散混沌系统(2DCS)。利用离散广义混沌同步理论和2D-CS构造了一个广义同步混沌系统(2D-GCS);通过一个实数域到整数域的变换设计了一个混沌伪随机数生...为设计性能较好的伪随机数发生器,提出了一个满足修正的马罗驼(Marotto)定理的新二维离散混沌系统(2DCS)。利用离散广义混沌同步理论和2D-CS构造了一个广义同步混沌系统(2D-GCS);通过一个实数域到整数域的变换设计了一个混沌伪随机数生成器(CPRNG);利用美国联邦信息处理标准(federal information processing standards,FIPS)提出的FIPS 140-2检测包分别对CPRNG和RC4算法产生的1000个二进制序列的随机性进行检测,结果均通过了检测。检测结果的平均值和方差对比表明CPRNG和RC4算法产生的伪随机序列随机性能相当,相关性检测结果表明该CPRNG在不同的密钥扰动下产生的密钥各组序列几乎完全独立,设计的CPRNG能产生性能良好的伪随机数。展开更多
基金National Natural Science Foundation of China(60363087 ,90104005 and 60473023)
文摘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.
基金supported by the Xiamen University Malaysia Research Fund(XMUMRF)(Grant No:XMUMRF/2019-C3/IECE/0007).
文摘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.
文摘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.
文摘The National Institute of Standards and Technology (NIST) document is a list of fifteen tests for estimating the probability of signal randomness degree. <span style="font-family:Verdana;">Test number six in the NIST document is the Discrete Fourier Transform</span><span style="font-family:Verdana;"> (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 </span><span style="font-family:Verdana;">or test, which may replace the NIST tests number six, seven and eight. The</span> <span style="font-family:Verdana;">proposed test is applicable also for non-stationary sequences and supplies</span><span style="font-family:Verdana;"> more </span><span style="font-family:Verdana;">accurate results than the existing tests (NIST tests number six, seven and</span><span style="font-family:Verdana;"> eight), for non-stationary sequences. The new proposed test is based on the Wigner function and on the Generalized Gaussian Distribution (GGD). In addition, </span><span style="font-family:Verdana;">this new proposed algorithm alarms and indicates on suspicious places of</span><span style="font-family:Verdana;"> cyclic </span><span style="font-family:Verdana;">sections in the tested sequence. Thus, it gives us the option to repair or to</span><span style="font-family:Verdana;"> remove the suspicious places of cyclic sections</span><span><span><span><span></span><span></span><b><span style="font-family:;" "=""><span></span><span></span> </span></b></span></span></span><span><span><span><span></span><span></span><span style="font-family:;" "=""><span></span><span></span><span style="font-family:Verdana;">(this part is beyond the scope </span><span style="font-family:Verdana;">of this paper), so that after that, the repaired or the shortened sequence</span><span style="font-family:Verdana;"> (origi</span><span style="font-family:Verdana;">nal sequence with removed sections) will result as a sequence with high</span><span style="font-family:Verdana;"> probability of random degree.</span></span></span></span></span>
基金Project supported by the National Natural Science Foundation of China,the UPGC of Hong Kong,Hong Kong Baptist University and SRCU.
文摘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.
文摘伪随机数发生器(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能产生性能良好的伪随机数。