An efficient authentication with key agreement procedure using Mittag–Leffler–Chebyshev summation chaotic map under the multi-server architecture

The recent technological advancement and rapid development of computer networks have increased the popularity of remote password authentication protocols. Toward this end, the emphasis has shifted to protocols that apply to smart cards-empowered multi-server environments. In order to defend against the replay attack, these protocols usually depend on the nonce or timestamp. In this paper, an efficient Mittag–Leffler–Chebyshev Summation Chaotic Map (MLCSCM)-enabled multi-server authentication protocol with the key agreement is proposed and generalized to address this peculiarity in multi-server-oriented applications. The security proof and efficiency analysis of the presented MLCSCM authenticated key agreement protocol is rigorously derived and validated. Compared to the recently published literature, the proposed protocol presents high efficiency with unique features, and it is highly resistant to sophisticated attacks and achieves perfect forward secrecy.