动态统计随机性检验的效率优化方案

Jiahui Shen, Tianyu Chen, Lei Wang, Yuan Ma
{"title":"动态统计随机性检验的效率优化方案","authors":"Jiahui Shen, Tianyu Chen, Lei Wang, Yuan Ma","doi":"10.1109/CSCloud.2015.10","DOIUrl":null,"url":null,"abstract":"The randomness of random number generators (RNGs) significantly influences the security of cryptographic systems. Although RNGs are allowed to adopt in practical systems only after strict analysis and security evaluation, the randomness of generated sequences may degrade due to aging effects of electronic devices, change of temperature and humidity, or even malicious attacks. Therefore, before the generated sequence being used (as a secret key or any other critical cryptography parameter), it is necessary to execute the on-the-fly statistical randomness test (on-the-fly test) on the candidate sequence to ensure the security. On-the-fly test should be finished efficiently; otherwise, it would impact the cryptographic systems' performance. In this paper, we propose a scheme to optimize the efficiency of randomness test suites, that is, provide an optimized order of the tests in the test suite, so that an unqualified sequence can be rejected as early as possible. We apply this optimization scheme on the NIST test suite (SP 800-22) [1] as an instance. Experimental results of 128- and 256- bit sequence, demonstrate that the optimized efficiency approximates to the theoretical optimum and the scheme can be quickly implemented.","PeriodicalId":278090,"journal":{"name":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Efficiency Optimization Scheme for the On-the-Fly Statistical Randomness Test\",\"authors\":\"Jiahui Shen, Tianyu Chen, Lei Wang, Yuan Ma\",\"doi\":\"10.1109/CSCloud.2015.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The randomness of random number generators (RNGs) significantly influences the security of cryptographic systems. Although RNGs are allowed to adopt in practical systems only after strict analysis and security evaluation, the randomness of generated sequences may degrade due to aging effects of electronic devices, change of temperature and humidity, or even malicious attacks. Therefore, before the generated sequence being used (as a secret key or any other critical cryptography parameter), it is necessary to execute the on-the-fly statistical randomness test (on-the-fly test) on the candidate sequence to ensure the security. On-the-fly test should be finished efficiently; otherwise, it would impact the cryptographic systems' performance. In this paper, we propose a scheme to optimize the efficiency of randomness test suites, that is, provide an optimized order of the tests in the test suite, so that an unqualified sequence can be rejected as early as possible. We apply this optimization scheme on the NIST test suite (SP 800-22) [1] as an instance. Experimental results of 128- and 256- bit sequence, demonstrate that the optimized efficiency approximates to the theoretical optimum and the scheme can be quickly implemented.\",\"PeriodicalId\":278090,\"journal\":{\"name\":\"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCloud.2015.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCloud.2015.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随机数生成器(rng)的随机性对密码系统的安全性影响很大。虽然只有经过严格的分析和安全评估才允许在实际系统中采用rng,但由于电子设备的老化、温度和湿度的变化,甚至恶意攻击,生成序列的随机性可能会降低。因此,在使用生成的序列(作为密钥或任何其他关键加密参数)之前,有必要对候选序列执行动态统计随机性测试(on- fly test),以确保安全性。实时测试要高效完成;否则会影响加密系统的性能。在本文中,我们提出了一种优化随机测试套件效率的方案,即提供测试套件中测试的优化顺序,以便尽早拒绝不合格的序列。我们将此优化方案应用于NIST测试套件(SP 800-22)[1]作为实例。128位和256位序列的实验结果表明,优化后的效率接近理论最优值,可以快速实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Efficiency Optimization Scheme for the On-the-Fly Statistical Randomness Test
The randomness of random number generators (RNGs) significantly influences the security of cryptographic systems. Although RNGs are allowed to adopt in practical systems only after strict analysis and security evaluation, the randomness of generated sequences may degrade due to aging effects of electronic devices, change of temperature and humidity, or even malicious attacks. Therefore, before the generated sequence being used (as a secret key or any other critical cryptography parameter), it is necessary to execute the on-the-fly statistical randomness test (on-the-fly test) on the candidate sequence to ensure the security. On-the-fly test should be finished efficiently; otherwise, it would impact the cryptographic systems' performance. In this paper, we propose a scheme to optimize the efficiency of randomness test suites, that is, provide an optimized order of the tests in the test suite, so that an unqualified sequence can be rejected as early as possible. We apply this optimization scheme on the NIST test suite (SP 800-22) [1] as an instance. Experimental results of 128- and 256- bit sequence, demonstrate that the optimized efficiency approximates to the theoretical optimum and the scheme can be quickly implemented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信