CRYPTANALYSIS ON “PRACTICAL AND PROVABLY SECURE THREE-FACTOR AUTHENTICATION PROTOCOL BASED ON EXTENDED CHAOTIC-MAPS FOR MOBILE LIGHTWEIGHT DEVICES”

Authors

  • Suresh Devanapalli and Kolloju Phaneendra

Keywords:

Security, Three-factor, Authentication, Chaotic-maps

Abstract

Authentication and key agreement (AKA) plays an important role in an open network environment in order to secure communication between two or more participants. Authentication and key agreement (AKA) protocols should protect the sensitive information against a malicious adversary by providing a variety of services, such as authentication, user credentials’ privacy, when the smart card is lost/stolen or the private key of a user or a server is revealed. Unfortunately, most of the existing an authentication and key agreement (AKA) protocols proposed in the literature do not safe against smart card loss attacks. Recently, in 2020, Shuming et al. proposed a secure three-factor authentication protocol based on extended chaotic-maps for mobile lightweight devices. In this paper, we analyze the Shuming et al’s protocol and show that Shuming et al’s scheme is vulnerable to privileged-insider attacks with the help of both offline password guessing attacks, user impersonation, Parallel session attacks and thus, their scheme fails to prevent known sessionspecific temporary information attack. In addition, we show that their scheme does not provide strong user’s anonymity. Furthermore, Shuming et al’s scheme cannot safe against smart card loss attacks. Apart from these, Shuming et al’s scheme has launch DoS attack.

Downloads

Published

2023-01-31

How to Cite

Suresh Devanapalli and Kolloju Phaneendra. (2023). CRYPTANALYSIS ON “PRACTICAL AND PROVABLY SECURE THREE-FACTOR AUTHENTICATION PROTOCOL BASED ON EXTENDED CHAOTIC-MAPS FOR MOBILE LIGHTWEIGHT DEVICES”. International Journal of Advances in Soft Computing and Intelligent Systems (IJASCIS), 2(1), 14–26. Retrieved from https://sciencetransactions.com/index.php/ijascis/article/view/43

Similar Articles

1 2 > >> 

You may also start an advanced similarity search for this article.