{'fraction_non_alphanumeric': 0.019747235387045814, 'fraction_numerical': 0.0, 'mean_word_length': 6.0, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Security analysis and improvement of a mutual authentication and key agreement solution for wireless sensor networks using chaotic maps

A characteristic of wireless sensor networks (WSNs) different from traditional networks is that WSNs are vulnerable to various types of attacks because of their distinctive features, involving distributed and nomadic attribute, wireless transmission medium, and lack of centralized infrastructure of security protection. Recently, Kumari et al presented a mutual authentication and key agreement scheme for WSNs using chaotic maps. Unfortunately, we find that the scheme of Kumari et al cannot resist sensor node capture attack, session‐specific temporary information attack, sensor node impersonation attack, and man‐in‐the‐middle attack. To overcome the security weaknesses in the solution of Kumari et al, this paper introduces a secure and efficient mutual authentication and key agreement scheme for heterogeneous ad hoc WSNs in fully public channel. Consequently, compared with the solution of Kumari et al, while providing relatively higher level of security and more security features, the proposed solution remains a favorable performance on communication overhead, computation overhead, and storage overhead separately.