On the collision property of chaotic iterations based post-treatments over cryptographic pseudorandom number generators

L. Marangio, C. Guyeux, J. Bahi
{"title":"On the collision property of chaotic iterations based post-treatments over cryptographic pseudorandom number generators","authors":"L. Marangio, C. Guyeux, J. Bahi","doi":"10.1109/MENACOMM.2018.8371008","DOIUrl":null,"url":null,"abstract":"There is not a proper mathematical definition of chaos, we have instead a quite big amount of definitions, each of one describes chaos in a more or less general context. Taking in account this, it is clear why it is hard to design an algorithm that produce random numbers, a kind of algorithm that could have plenty of concrete appliceautifat (anul)d bions. However we must use a finite state machine (e.g. a laptop) to produce such a sequence of random numbers, thus it is convenient, for obvious reasons, to redefine those aimed sequences as pseudorandom; also problems arise with floating point arithmetic if one wants to recover some real chaotic property (i.e. properties from functions defined on the real numbers). All this considerations are synthesized in the problem of the Pseudorandom number generators (PRNGs). A solution to these obstacles may be to post-operate on existing PRNGs to improve their performances, using the so-called chaotic iterations, i.e., specific iterations of a boolean function and a shift operator that use the inputted generator. This approach leads to a mathematical description of such PRNGs as discrete dynamical systems, on which chaos properties can be investigated using mathematical topology and measure theory. Such properties are well-formulated, and they allow us to characterize which functions improves the sensitivity to the seed, the expansivity, the ergodicity, or the topological mixing of the generator resulting from such a post-processing. Experience shows that choosing relevant boolean functions in these chaotic iterations improves the randomness of the inputted generator, for instance when considering the number of statistical tests of randomness passed successfully. If we focus on the cryptographical application of PRNGs, there are two main classical notions to be considered, namely collision and avalanche effect. In this article, we recall the chaotic properties of the proposed post-treatment and we study the collision property in families of pseudorandom sequences produced by this process.","PeriodicalId":398620,"journal":{"name":"2018 IEEE Middle East and North Africa Communications Conference (MENACOMM)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Middle East and North Africa Communications Conference (MENACOMM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MENACOMM.2018.8371008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

There is not a proper mathematical definition of chaos, we have instead a quite big amount of definitions, each of one describes chaos in a more or less general context. Taking in account this, it is clear why it is hard to design an algorithm that produce random numbers, a kind of algorithm that could have plenty of concrete appliceautifat (anul)d bions. However we must use a finite state machine (e.g. a laptop) to produce such a sequence of random numbers, thus it is convenient, for obvious reasons, to redefine those aimed sequences as pseudorandom; also problems arise with floating point arithmetic if one wants to recover some real chaotic property (i.e. properties from functions defined on the real numbers). All this considerations are synthesized in the problem of the Pseudorandom number generators (PRNGs). A solution to these obstacles may be to post-operate on existing PRNGs to improve their performances, using the so-called chaotic iterations, i.e., specific iterations of a boolean function and a shift operator that use the inputted generator. This approach leads to a mathematical description of such PRNGs as discrete dynamical systems, on which chaos properties can be investigated using mathematical topology and measure theory. Such properties are well-formulated, and they allow us to characterize which functions improves the sensitivity to the seed, the expansivity, the ergodicity, or the topological mixing of the generator resulting from such a post-processing. Experience shows that choosing relevant boolean functions in these chaotic iterations improves the randomness of the inputted generator, for instance when considering the number of statistical tests of randomness passed successfully. If we focus on the cryptographical application of PRNGs, there are two main classical notions to be considered, namely collision and avalanche effect. In this article, we recall the chaotic properties of the proposed post-treatment and we study the collision property in families of pseudorandom sequences produced by this process.
基于密码伪随机数生成器后处理的混沌迭代碰撞特性研究
混沌没有一个恰当的数学定义,我们有大量的定义,每一个定义都或多或少地描述了混沌的一般情况。考虑到这一点,很明显为什么很难设计出一种产生随机数的算法,这种算法可能有大量的具体应用价值(每年)十亿。然而,我们必须使用有限状态机(例如笔记本电脑)来产生这样的随机数序列,因此,出于明显的原因,将这些目标序列重新定义为伪随机是很方便的;如果想要恢复一些真正的混沌属性(即在实数上定义的函数的属性),浮点算术也会出现问题。在伪随机数生成器(prng)问题中综合了所有这些考虑。解决这些障碍的方法可能是使用所谓的混沌迭代,即布尔函数的特定迭代和使用输入生成器的移位算子,对现有的prng进行后操作以提高其性能。这种方法导致了这种prng作为离散动力系统的数学描述,可以使用数学拓扑和测量理论来研究其混沌特性。这些性质是很好的表述,它们使我们能够描述哪些功能可以提高对种子的敏感性,扩张性,遍历性或由后处理产生的生成器的拓扑混合。经验表明,在这些混沌迭代中选择相关的布尔函数可以改善输入生成器的随机性,例如在考虑成功通过随机性的统计测试次数时。如果我们关注prng的密码学应用,有两个主要的经典概念需要考虑,即碰撞和雪崩效应。在本文中,我们回顾了所提出的后处理的混沌性质,并研究了由该过程产生的伪随机序列族的碰撞性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信
小红书