A Comparative Statistical Analysis of Pseudorandom Bit Sequences
Many users applied built-in random generator for their cryptography applications which is simple and fast. However, the randomness of generated pseudorandom numbers (PRNs) is under questioned whether it can support the reliable security in secure communication. In this paper, we examined two kinds of pseudorandom bit sequence (PRBS); conventional PRBS and chaos-based PRBS. Linear Congruential method, Marsaglias Ziggurat algorithm and Mersenne Twister method are used to generate the former, and the latter is produced using chebychev map, logistic map and sawtooth-like map. To verify the randomness of the PRBS, two standard statistical tests FIPS140-2 and SP800-22 are performed. The results have been compared and analysed between conventional PRBS and chaos-based PRBS on their reliability as encryption key.
random number generation chaos PRNG PRBS chaos-based PRNG randomness test
Rashidah Kadir Mohd Aizaini Maarof
Faculty of Computer Science & Information Systems Universiti Teknologi Malaysia 81310 UTM Skudai,Johor,MALAYSIA
国际会议
The Fifth International Conference on Information Assurance and Security(第五届信息保障与安全国际会议)
西安
英文
91-94
2009-08-18(万方平台首次上网日期,不代表论文的发表时间)