首页> 外文会议>International Conference on Innovations in Computer Science and Engineering >Designing Chaotic Chirikov Map-Based Secure Hash Function
【24h】

Designing Chaotic Chirikov Map-Based Secure Hash Function

机译:设计混沌Chirikov地图的安全哈希函数

获取原文

摘要

In this paper, a new algorithm for designing one-way cryptographic hash function using chaotic Chirikov map is proposed. High sensitivity of Chirikov system makes it an ideal candidate for secure hash function design. In the proposed algorithm, the input message is split into a number of small blocks. The blocks are processed using chaotic map. The two intermediate hashes are generated using evolved control and input parameters. The two intermediate hash values are then employed to yield the final variable-length hash. The simulation and statistical analyses illustrate that the anticipated hash algorithm exhibits encouraging lineaments like high sensitivity to input messages and key, satisfactory confusion and diffusion attributes which verify the suitableness of proposed algorithm for the design of secure cryptographic variable-length hash functions.
机译:在本文中,提出了一种使用混沌Chirikov地图设计单向加密散列函数的新算法。 Chirikov系统的高灵敏度使其成为安全哈希函数设计的理想候选者。在所提出的算法中,输入消息被分成多个小块。使用混沌映射处理块。使用进化的控制和输入参数生成两个中间散列。然后采用两个中间哈希值来产生最终的可变长度散列。模拟和统计分析说明预期的哈希算法表现出令人鼓舞的谱系,如高灵敏度,如对输入消息和密钥,令人满意的混淆和扩散属性的高度敏感性,令人满意的困难和扩散属性,该属性验证了所提出的安全加密可变长度散列函数设计算法的适当性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号