基于元胞自动机的Mersenne扭转仿真

IF 0.5 Q4 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Kamalika Bhattacharjee, Nitin More, Shobhit Kumar Singh, Nikhil Verma
{"title":"基于元胞自动机的Mersenne扭转仿真","authors":"Kamalika Bhattacharjee, Nitin More, Shobhit Kumar Singh, Nikhil Verma","doi":"10.25088/complexsystems.32.2.139","DOIUrl":null,"url":null,"abstract":"The Mersenne Twister (MT) (MT19937), developed 30 years ago, is the de facto pseudorandom number generator (PRNG) used in many computer programs. This paper proposes a candidate that offers a randomness quality that is better than MT19937 and its sisters SFMT19937 and TinyMT. A special three-neighborhood, two-state cellular automaton (CA), called CA (150′) is the underlying model of this PRNG. The same working style of MT19937 is used, while avoiding the problems of the MT, like a large state space and the zero-access initial state problem. Nonlinearity is added in the base simple linear CA such that the properties of the base CA are not violated. Finally, a PRNG is developed using this CA that beats MT19937 as well as its advanced versions over the standard empirical platforms Dieharder, TestU01 and NIST.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":"173 1","pages":"0"},"PeriodicalIF":0.5000,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cellular Automaton-Based Emulation of the Mersenne Twiste\",\"authors\":\"Kamalika Bhattacharjee, Nitin More, Shobhit Kumar Singh, Nikhil Verma\",\"doi\":\"10.25088/complexsystems.32.2.139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Mersenne Twister (MT) (MT19937), developed 30 years ago, is the de facto pseudorandom number generator (PRNG) used in many computer programs. This paper proposes a candidate that offers a randomness quality that is better than MT19937 and its sisters SFMT19937 and TinyMT. A special three-neighborhood, two-state cellular automaton (CA), called CA (150′) is the underlying model of this PRNG. The same working style of MT19937 is used, while avoiding the problems of the MT, like a large state space and the zero-access initial state problem. Nonlinearity is added in the base simple linear CA such that the properties of the base CA are not violated. Finally, a PRNG is developed using this CA that beats MT19937 as well as its advanced versions over the standard empirical platforms Dieharder, TestU01 and NIST.\",\"PeriodicalId\":46935,\"journal\":{\"name\":\"Complex Systems\",\"volume\":\"173 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Complex Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.25088/complexsystems.32.2.139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Complex Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.25088/complexsystems.32.2.139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

30年前开发的Mersenne Twister (MT) (MT19937)实际上是许多计算机程序中使用的伪随机数生成器(PRNG)。本文提出了一个候选算法,它提供了比MT19937及其姊妹算法SFMT19937和TinyMT更好的随机质量。一种特殊的三邻域双状态元胞自动机(CA),称为CA(150 '),是该PRNG的基础模型。使用与MT19937相同的工作方式,同时避免了MT存在的大状态空间和零访问初始状态问题。在基本简单线性CA中加入非线性,使基本CA的性质不受破坏。最后,使用该CA开发了一个PRNG,该CA击败了MT19937及其在标准经验平台Dieharder, TestU01和NIST上的高级版本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cellular Automaton-Based Emulation of the Mersenne Twiste
The Mersenne Twister (MT) (MT19937), developed 30 years ago, is the de facto pseudorandom number generator (PRNG) used in many computer programs. This paper proposes a candidate that offers a randomness quality that is better than MT19937 and its sisters SFMT19937 and TinyMT. A special three-neighborhood, two-state cellular automaton (CA), called CA (150′) is the underlying model of this PRNG. The same working style of MT19937 is used, while avoiding the problems of the MT, like a large state space and the zero-access initial state problem. Nonlinearity is added in the base simple linear CA such that the properties of the base CA are not violated. Finally, a PRNG is developed using this CA that beats MT19937 as well as its advanced versions over the standard empirical platforms Dieharder, TestU01 and NIST.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Complex Systems
Complex Systems MATHEMATICS, INTERDISCIPLINARY APPLICATIONS-
CiteScore
1.80
自引率
25.00%
发文量
18
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信