Using time-stamp to improve the security of a chaotic maps-based key agreement protocol

Information Sciences

Volumn 178, Issue 6, 2008, Pages 1598-1602

  Xiao, Di ^a   Liao, Xiaofeng ^a   Deng, Shaojiang ^a  

^a CHONGQING UNIVERSITY   (China)

Author keywords

Chaos; Hash; Key agreement; Replaying attack; Semi group; Time stamp

Indexed keywords

CHEBYSHEV APPROXIMATION; COMPUTER SIMULATION; NUMERICAL METHODS;

AGREEMENT PROTOCOLS; REPLAYING ATTACK;

CHAOTIC SYSTEMS;

EID: 38349025681     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.11.001     Document Type: Article

References (7)

1. Alvarez G. Security problems with a chaos-based deniable authentication scheme. Chaos, Solitions and Fractals 26 (2005) 7-11
2. Bergamo P., D'Arco P., Santis A., and Kocarev L. Security of public key cryptosystems based on Chebyshev polynomials. IEEE Transactions on Circuits and Systems - I 52 (2005) 1382-1393
3. Han S. Security of a key agreement protocol based on chaotic maps. Chaos, Solitions and Fractals (2007) 10.1016/j.chaos.2007.01.017
4. L. Kocarev, Z. Tasev, Public key encryption based on Chebyshev maps, in: Proceedings of 2003 IEEE Symposium on Circuits and Systems, Bangkok, TH, vol. 3, 2003, pp. 28-31.
5. Menezes A., van Oorschot P., and Vanstone S. Handbook of Applied Cryptography (1997), CRC Press, Boca Raton
6. Xiao D., Liao X., and Deng S. One-way Hash function construction based on the chaotic map with changeable-parameter. Chaos, Solitions and Fractals 24 (2005) 65-71
7. Xiao D., Liao X., and Deng S. A novel key agreement protocol based on chaotic maps. Information Sciences 177 (2007) 1136-1142