Using time-stamp to improve the security of a chaotic maps-based key agreement protocol. (English) Zbl 1131.94017

Summary: Based on the semi-group property of Chebyshev chaotic map and time-stamp, we propose an enhanced chaotic maps-based key agreement protocol, which is more secure than the original one and can resist the replaying attack.


94A60 Cryptography
Full Text: DOI


[1] Alvarez, G., Security problems with a chaos-based deniable authentication scheme, Chaos, solitions and fractals, 26, 7-11, (2005) · Zbl 1077.94019
[2] Bergamo, P.; D’Arco, P.; Santis, A.; Kocarev, L., Security of public key cryptosystems based on Chebyshev polynomials, IEEE transactions on circuits and systems - I, 52, 1382-1393, (2005) · Zbl 1374.94775
[3] Han, Song, Security of a key agreement protocol based on chaotic maps, Chaos, solitions and fractals, (2007) · Zbl 1146.94304
[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.; Vanstone, S., Handbook of applied cryptography, (1997), CRC Press Boca Raton · Zbl 0868.94001
[6] Xiao, D.; Liao, X.; Deng, S., One-way hash function construction based on the chaotic map with changeable-parameter, Chaos, solitions and fractals, 24, 65-71, (2005) · Zbl 1068.94019
[7] Xiao, D.; Liao, X.; Deng, S., A novel key agreement protocol based on chaotic maps, Information sciences, 177, 1136-1142, (2007)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.