An ID-based remote mutual authentication with key agreement scheme for mobile devices on elliptic curve cryptosystem

An Efficient and More Secure ID Based Mutual Authentication Scheme Based on ECC for Mobile Devices

“…This section evaluates the performance of the proposed scheme in terms computation cost of proposed scheme with other schemes [2,3,4,5,6]. To estimate the computation cost of proposed scheme, the following notations are defined: PM is the time complexity to execute elliptic curve scalar point multiplication, H is the time complexity to execute hash operation and PA is the time complexity to execute elliptic curve scalar point addition.…”

“…In this section, the paper "A more efficient and secure ID-based remote mutual authentication with key agreement scheme for mobile devices [4]" is review & show that their scheme's vulnerable to known session-specific temporary information attack and denial of service resulting from leaking server's database.…”

“…U keys identity IDU and AIDU into the mobile device & randomly chooses a number rU from [1, n -1], and computes N=R+AIDU (8) M=rU.QS (9) Where R = rU. P. U computes the dynamic identity CIDU = IDU ⊕ H2(R || AIDU) (10) and sends the message (CIDU, N, M) to S.…”

“…And they also claimed that their system's more secured to authenticate users and remote servers for mobile devices. However, Islam and Biswas [4] in 2011 have provided a security for mobile devices on elliptic curve cryptosystem. Then, they claimed that their system's truly efficient and usable for mobile users in many internet applications or wireless networks.…”

“…Besides, our system possesses low power consumption and computation cost than previous systems. Our main ideas aren't using point addition operation between a random point and user's authentication key and not letting random value is stored into server's database to fix recommended problems of Islam's system [4].…”