一种混沌密钥Hash函数的性质分析
Quality Analysis of a Chaotic Proven Keyed Hash Function
摘要：
哈希函数是一种加密工具，主要用于完整性检查和密码存储。它们对于提高通过因特网进行交流的安全性至关重要。然而，由于最近在该领域的当前标准中发现了安全缺陷，因此必须研究新的散列数字数据的方法。在本文档中，评估原始的带密钥的散列函数。它基于异步迭代，导致已被证明是混乱的函数。因此，它具有各种拓扑性质的一致性和敏感性，其初始条件。这些属性使我们的哈希函数满足该领域的既定安全要求。在这项研究工作中，这一说法得到了定性的证明和实验的验证，其中包括实现了大量的模拟。
英文摘要：
Hash functions are cryptographic tools, which are notably involved in integrity checking and password storage. They are of primary importance to improve the security of exchanges through the Internet. However, as security flaws have been recently identified in the current standard in this domain, new ways to hash digital data must be investigated. In this document an original keyed hash function is evaluated. It is based on asynchronous iterations leading to functions that have been proven to be chaotic. It thus possesses various topological properties as uniformity and sensibility to its initial condition. These properties make our hash function satisfies established security requirements in this field. This claim is qualitatively proven and experimentally verified in this research work, among other things by realizing a large number of simulations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
