4.7 Article

Secure group key agreement protocol based on chaotic Hash

期刊

INFORMATION SCIENCES
卷 180, 期 20, 页码 4069-4074

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2010.06.013

关键词

Chaos; Hash function; Key agreement; Chebyshev

资金

  1. National Natural Science Foundation of China [60572027]
  2. Program for New Century Excellent Talents in University of China [NCET-05-0794]
  3. Foundation for Young Scientists of Sichuan Province, China [03ZQ026-033]
  4. Application Basic Foundation of Sichuan Province, China [2006J13-110]
  5. Foundation of Southwest University for Nationalities [09NYB002, 08NBS003]

向作者/读者索取更多资源

Recently, Xiao et al. proposed an improved key agreement protocol based on chaotic maps, in which only a predetermined long-term key is utilized to ensure its security. This paper demonstrates that none of these schemes can satisfy the contributory nature of key agreement. To fill the gaps, we present a secure key agreement protocol based on chaotic Hash. The proposed scheme utilizes the chaotic Hash function to achieve the contributory nature anti enhance its security. Cryptanalysis demonstrates that our chaotic Hash-based scheme can overcome all the current deficiencies. (C) 2010 Published by Elsevier Inc.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据