Skip to main content

Table 9 The running time of the elliptic curve point multiplication among related protocols in authentication phase

From: An elliptic curve cryptosystem-based secure RFID mutual authentication for Internet of things in healthcare environment

 

Running time of the elliptic curve point multiplication

Total

Tag

Reader

Liao [16]

\(5T_{PM} = 5*64 = 320\)

\(5T_{PM} = 5*64 = 320\)

\(640(ms)\)

Alamr [3]

\(4T_{PM} = 4*64 = 256\)

\(5T_{PM} = 5*64 = 320\)

\(576(ms)\)

Sowjanya [19]

\(3T_{PM} = 3*64 = 192\)

\(6T_{PM} = 6*64 = 384\)

\(576(ms)\)

Dang [21]

\(5T_{PM} = 5*64 = 320\)

\(3T_{PM} = 3*64 = 192\)

\(512(ms)\)

Proposed scheme

\(3T_{PM} = 3*64 = 192\)

\(3T_{PM} = 3*64 = 192\)

\(384(ms)\)