Cryptanalysis of a key agreement protocol based on chaotic Hash
by Debiao He; Muhammad Khurram Khan
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 5, No. 3/4, 2013

Abstract: With the rapid development of theory and application of chaos, the chaotic Hash has been widely used in cryptosystems. Recently, Guo and Zhang proposed a secure key agreement protocol based on chaotic Hash. They claimed that their protocol could withstand various attacks. Unfortunately, by giving concrete attacks, we demonstrate that Guo and Zhang's protocol is vulnerable to the offline password guessing attack. The analysis shows their protocol is not secure for practical application.

Online publication date: Sat, 26-Jul-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com