{"title":"整数逻辑映射的周期和链路长度","authors":"Takeru Miyazaki, Shunsuke Araki, S. Uehara","doi":"10.1109/ISITA.2008.4895610","DOIUrl":null,"url":null,"abstract":"On the designing of a pseudo-random number generator from a sequence generated by the logistic map, period and link length of the sequence are important for good randomness. In this paper, we focus loops and links of sequences generated by the logistic map over integers. Since their periods and link lengths of them depend on an available bit. We consider the relation between the available bit and expected values of them.","PeriodicalId":338675,"journal":{"name":"2008 International Symposium on Information Theory and Its Applications","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Period and link length of logistic map over integers\",\"authors\":\"Takeru Miyazaki, Shunsuke Araki, S. Uehara\",\"doi\":\"10.1109/ISITA.2008.4895610\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"On the designing of a pseudo-random number generator from a sequence generated by the logistic map, period and link length of the sequence are important for good randomness. In this paper, we focus loops and links of sequences generated by the logistic map over integers. Since their periods and link lengths of them depend on an available bit. We consider the relation between the available bit and expected values of them.\",\"PeriodicalId\":338675,\"journal\":{\"name\":\"2008 International Symposium on Information Theory and Its Applications\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Information Theory and Its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISITA.2008.4895610\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on Information Theory and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISITA.2008.4895610","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Period and link length of logistic map over integers
On the designing of a pseudo-random number generator from a sequence generated by the logistic map, period and link length of the sequence are important for good randomness. In this paper, we focus loops and links of sequences generated by the logistic map over integers. Since their periods and link lengths of them depend on an available bit. We consider the relation between the available bit and expected values of them.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
