Identifying attributes and insecurity of a public-channel key exchange protocol using chaos synchronization
Creators
- 1. Curtin University of Technology, G.P.O. Box U1987 Perth, WA 6845 (Australia)
- 2. National Chung Hsing University, Kuo Kuang Road, Taichung, Taiwan (China)
- 3. Asia University, Lioufeng Road, Wufeng Shiang, Taichung, Taiwan (China)
Description
Klein et al. proposed a key exchange protocol using chaos synchronization. The first protocol comprises two parties with chaotic dynamics that are mutually coupled and undergo a synchronization process, at the end of which they can use their identical dynamical state as an encryption key. From cryptographic point of view, their key exchange protocol is a key agreement protocol. Klein et al. claimed that their key agreement can be carried out over a public channel. In order to increase the key space and decrease the precision of the calculation, they made an extension of the system to a network of N Lorenz equations. In this paper, we will provide a cryptanalysis of their key agreement protocol. We will first point out some weaknesses, and then show that their protocol is not secure against several attacks including impersonation attack.
Availability note (English)
Available from http://dx.doi.org/10.1016/j.chaos.2007.10.050Additional details
Identifiers
- DOI
- 10.1016/j.chaos.2007.10.050;
- PII
- S0960-0779(07)00933-2;
Publishing Information
- Journal Title
- Chaos, Solitons and Fractals
- Journal Volume
- 40
- Journal Issue
- 5
- Journal Page Range
- p. 2569-2575
- ISSN
- 0960-0779
INIS
- Country of Publication
- United Kingdom
- Country of Input or Organization
- International Atomic Energy Agency (IAEA)
- INIS RN
- 41014305
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING;
- Descriptors DEI
- ACCURACY; CHAOS THEORY; CRYPTOGRAPHY; EQUATIONS; SYNCHRONIZATION
- Descriptors DEC
- MATHEMATICS
Optional Information
- Copyright
- Copyright (c) 2007 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.