 Chaotic map based key agreement with/out clock synchronizationS. Han and E. Chang Chaos, Solitons & Fractals, 2009, vol. 39, issue 3, 1283-1289 Abstract: In order to address Bergamo et al.’s attack, Xiao et al. proposed a key agreement protocol using chaotic maps. Han then presented three attacks on Xiao et al.’s protocol. To enhance the security of key agreement based on chaotic maps, Chang et al. proposed a new key agreement using passphrase, which works in clock synchronization environment. However, their protocol still has some issues: one is its passphrase is not easy to remember and much longer than password; the second one is it cannot resist guessing attack if the constructed passphrase is easy to remember and also has already existed in some rational dictionaries; the third one is it cannot work without clock synchronization. In this paper, we will present two different key agreement protocols, which can resist guessing attack. The first one works in clock synchronization environment. The second one can work without clock synchronization. They both use authenticated password for secure communications. The protocols are secure against replaying attacks and a shared session key can be established. Date: 2009 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:39:y:2009:i:3:p:1283-1289 DOI: 10.1016/j.chaos.2007.06.030 Access Statistics for this article Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros More articles in Chaos, Solitons & Fractals from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.