{"title":"利用数字化混沌系统生成伪随机序列","authors":"T. Addabbo, A. Fort, S. Rocchi, V. Vignoli","doi":"10.1109/ECCTD.2007.4529677","DOIUrl":null,"url":null,"abstract":"In this paper a novel family of maximum-period Nonlinear Congruential Generators (NLCGs) based on the digitized Renyi chaotic map is considered for the definition of hardware-efficient Pseudo Random Number Generators (PRNGs). In detail, a theoretical result is provided about the periodicity of the output sequences generated by the proposed NLCGs. Moreover, the distribution of the generated numbers is discussed, comparing the results obtained the proposed NLCGs with those obtainable from traditional PRNGs based on linear recurrences methods.","PeriodicalId":445822,"journal":{"name":"2007 18th European Conference on Circuit Theory and Design","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"On the generation of pseudo-random sequences exploiting digitized chaotic systems\",\"authors\":\"T. Addabbo, A. Fort, S. Rocchi, V. Vignoli\",\"doi\":\"10.1109/ECCTD.2007.4529677\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper a novel family of maximum-period Nonlinear Congruential Generators (NLCGs) based on the digitized Renyi chaotic map is considered for the definition of hardware-efficient Pseudo Random Number Generators (PRNGs). In detail, a theoretical result is provided about the periodicity of the output sequences generated by the proposed NLCGs. Moreover, the distribution of the generated numbers is discussed, comparing the results obtained the proposed NLCGs with those obtainable from traditional PRNGs based on linear recurrences methods.\",\"PeriodicalId\":445822,\"journal\":{\"name\":\"2007 18th European Conference on Circuit Theory and Design\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 18th European Conference on Circuit Theory and Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECCTD.2007.4529677\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 18th European Conference on Circuit Theory and Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECCTD.2007.4529677","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the generation of pseudo-random sequences exploiting digitized chaotic systems
In this paper a novel family of maximum-period Nonlinear Congruential Generators (NLCGs) based on the digitized Renyi chaotic map is considered for the definition of hardware-efficient Pseudo Random Number Generators (PRNGs). In detail, a theoretical result is provided about the periodicity of the output sequences generated by the proposed NLCGs. Moreover, the distribution of the generated numbers is discussed, comparing the results obtained the proposed NLCGs with those obtainable from traditional PRNGs based on linear recurrences methods.