离散混沌上的高吞吐量伪随机数发生器

IF 4.9 2区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Carlos E. C. Souza;Davi Moreno;Matheus H. S. Sousa;Daniel P. B. Chaves;Cecilio Pimentel
{"title":"离散混沌上的高吞吐量伪随机数发生器","authors":"Carlos E. C. Souza;Davi Moreno;Matheus H. S. Sousa;Daniel P. B. Chaves;Cecilio Pimentel","doi":"10.1109/TCSII.2025.3585809","DOIUrl":null,"url":null,"abstract":"In this brief we propose two pseudo-random number generators (PRNGs) based on the discrete Arnold cat map (DACM) over the integer ring <inline-formula> <tex-math>$\\mathbb {Z}_{2^{m}}$ </tex-math></inline-formula>. The first PRNG employs or-exclusive (XOR) and bit permutations, discarding multiplication operations. The second PRNG proposes a methodology to double the number of bits extracted from each chaotic sample, increasing the bit generation rate. The statistical properties of the PRNGs are analyzed with the statistical test suites NIST and TestU01. The proposed PRNGs are implemented in the field-programmable gate array (FPGA) Xilinx Zynq-7000 and their hardware complexity is analyzed. We show that the maximum throughput obtained by one of the proposed PRNGs is 19 Gbps, which outperforms recent approaches.","PeriodicalId":13101,"journal":{"name":"IEEE Transactions on Circuits and Systems II: Express Briefs","volume":"72 9","pages":"1303-1307"},"PeriodicalIF":4.9000,"publicationDate":"2025-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"High-Throughput Pseudo-Random Number Generators Over Discrete Chaos\",\"authors\":\"Carlos E. C. Souza;Davi Moreno;Matheus H. S. Sousa;Daniel P. B. Chaves;Cecilio Pimentel\",\"doi\":\"10.1109/TCSII.2025.3585809\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this brief we propose two pseudo-random number generators (PRNGs) based on the discrete Arnold cat map (DACM) over the integer ring <inline-formula> <tex-math>$\\\\mathbb {Z}_{2^{m}}$ </tex-math></inline-formula>. The first PRNG employs or-exclusive (XOR) and bit permutations, discarding multiplication operations. The second PRNG proposes a methodology to double the number of bits extracted from each chaotic sample, increasing the bit generation rate. The statistical properties of the PRNGs are analyzed with the statistical test suites NIST and TestU01. The proposed PRNGs are implemented in the field-programmable gate array (FPGA) Xilinx Zynq-7000 and their hardware complexity is analyzed. We show that the maximum throughput obtained by one of the proposed PRNGs is 19 Gbps, which outperforms recent approaches.\",\"PeriodicalId\":13101,\"journal\":{\"name\":\"IEEE Transactions on Circuits and Systems II: Express Briefs\",\"volume\":\"72 9\",\"pages\":\"1303-1307\"},\"PeriodicalIF\":4.9000,\"publicationDate\":\"2025-07-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Circuits and Systems II: Express Briefs\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/11068115/\",\"RegionNum\":2,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, ELECTRICAL & ELECTRONIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Circuits and Systems II: Express Briefs","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/11068115/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了两个基于整数环$\mathbb {Z}_{2^{m}}$上的离散阿诺德猫映射(DACM)的伪随机数生成器(prng)。第一个PRNG使用或排他(XOR)和位置换,丢弃乘法操作。第二种PRNG提出了一种方法,将从每个混沌样本中提取的比特数增加一倍,从而提高比特生成率。利用统计测试套件NIST和TestU01对prng的统计特性进行了分析。提出的prng在Xilinx Zynq-7000现场可编程门阵列(FPGA)上实现,并对其硬件复杂度进行了分析。我们表明,其中一种提出的prng获得的最大吞吐量为19 Gbps,优于最近的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
High-Throughput Pseudo-Random Number Generators Over Discrete Chaos
In this brief we propose two pseudo-random number generators (PRNGs) based on the discrete Arnold cat map (DACM) over the integer ring $\mathbb {Z}_{2^{m}}$ . The first PRNG employs or-exclusive (XOR) and bit permutations, discarding multiplication operations. The second PRNG proposes a methodology to double the number of bits extracted from each chaotic sample, increasing the bit generation rate. The statistical properties of the PRNGs are analyzed with the statistical test suites NIST and TestU01. The proposed PRNGs are implemented in the field-programmable gate array (FPGA) Xilinx Zynq-7000 and their hardware complexity is analyzed. We show that the maximum throughput obtained by one of the proposed PRNGs is 19 Gbps, which outperforms recent approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Circuits and Systems II: Express Briefs
IEEE Transactions on Circuits and Systems II: Express Briefs 工程技术-工程:电子与电气
CiteScore
7.90
自引率
20.50%
发文量
883
审稿时长
3.0 months
期刊介绍: TCAS II publishes brief papers in the field specified by the theory, analysis, design, and practical implementations of circuits, and the application of circuit techniques to systems and to signal processing. Included is the whole spectrum from basic scientific theory to industrial applications. The field of interest covered includes: Circuits: Analog, Digital and Mixed Signal Circuits and Systems Nonlinear Circuits and Systems, Integrated Sensors, MEMS and Systems on Chip, Nanoscale Circuits and Systems, Optoelectronic Circuits and Systems, Power Electronics and Systems Software for Analog-and-Logic Circuits and Systems Control aspects of Circuits and Systems.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信