{"title":"几种伪随机数生成器的伪随机性及其应用研究","authors":"L. Min, Kexin Hu, Lijiao Zhang, Yuqun Zhang","doi":"10.1109/CIS.2013.126","DOIUrl":null,"url":null,"abstract":"Pseudo random numbers are important in various applications. Pseudo random number generators (PRNGs) have been used widely to provide ideal pseudo random number generating sources. Recently the researches on chaos-based PRNGs have also attracted much attention. Based on Li-York's chaotic map criteria, this paper introduces a novel piecewise linear chaotic map (PLCM). Combining the PLCM with the logistic map designs a chaotic PRNG (CPRNG). Using the FIPS 140-2 test suit tests the randomness of two 1000 key streams consisting of 20000 bits and 220 bits, respectively. The results show that for the 1000 key streams consisting of 20000 bits, the statistical properties of the randomness of the sequences generated via the CPRNG and an m-sequence PRNG do not have significant differences. As applications, image encryption examples via the CPRNG and the m-Sequence based PRNG are given.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"14 ","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Study on Pseudorandomness of Some Pseudorandom Number Generators with Application\",\"authors\":\"L. Min, Kexin Hu, Lijiao Zhang, Yuqun Zhang\",\"doi\":\"10.1109/CIS.2013.126\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Pseudo random numbers are important in various applications. Pseudo random number generators (PRNGs) have been used widely to provide ideal pseudo random number generating sources. Recently the researches on chaos-based PRNGs have also attracted much attention. Based on Li-York's chaotic map criteria, this paper introduces a novel piecewise linear chaotic map (PLCM). Combining the PLCM with the logistic map designs a chaotic PRNG (CPRNG). Using the FIPS 140-2 test suit tests the randomness of two 1000 key streams consisting of 20000 bits and 220 bits, respectively. The results show that for the 1000 key streams consisting of 20000 bits, the statistical properties of the randomness of the sequences generated via the CPRNG and an m-sequence PRNG do not have significant differences. As applications, image encryption examples via the CPRNG and the m-Sequence based PRNG are given.\",\"PeriodicalId\":294223,\"journal\":{\"name\":\"2013 Ninth International Conference on Computational Intelligence and Security\",\"volume\":\"14 \",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Ninth International Conference on Computational Intelligence and Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CIS.2013.126\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Ninth International Conference on Computational Intelligence and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIS.2013.126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Study on Pseudorandomness of Some Pseudorandom Number Generators with Application
Pseudo random numbers are important in various applications. Pseudo random number generators (PRNGs) have been used widely to provide ideal pseudo random number generating sources. Recently the researches on chaos-based PRNGs have also attracted much attention. Based on Li-York's chaotic map criteria, this paper introduces a novel piecewise linear chaotic map (PLCM). Combining the PLCM with the logistic map designs a chaotic PRNG (CPRNG). Using the FIPS 140-2 test suit tests the randomness of two 1000 key streams consisting of 20000 bits and 220 bits, respectively. The results show that for the 1000 key streams consisting of 20000 bits, the statistical properties of the randomness of the sequences generated via the CPRNG and an m-sequence PRNG do not have significant differences. As applications, image encryption examples via the CPRNG and the m-Sequence based PRNG are given.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
