Security analysis for chaotic maps-based mutual authentication and key agreement using smart cards for wireless networks

Abstract

The authentication of mobile users and establishing a shared key for wireless networks is becoming more emerging, as the number of users who want to roam into a foreign network to use a service increases as well as the increase in the number of such networks. Recently, a number of such protocols are proposed which their security rely on modular exponentiations or scalar multiplications over elliptic curves. In 2013, C. Guo et al. proposed a novel such protocol using a chaos-based key-establishment algorithm which was proposed by L. Kocarev and Z. Tasev in 2003. Their protocol makes it possible for both mobile user and the foreign agent to be mutually authenticated by a host agent. A deeper security analysis of their protocol shows some vulnerabilities. In this paper, we will enhance this protocol by applying fixes to these vulnerabilities and state a set of security requirements for it. We will also investigate the computational complexity of the enhanced protocol and efficient ways to compute the iterations of the first type of Chebyshev polynomials.