| Running time of the elliptic curve point multiplication | Total computational costs | |
---|---|---|---|
Tag | Reader | ||
Liao and Hsiao [36] | 5TPM = 5 × 64 = 320 | 5TPM = 5 × 64 = 320 | 640(ms) |
Alamr et al. [35] | 4TPM = 4 × 64 = 256 | 5TPM = 5 × 64 = 320 | 576(ms) |
Zhao [3] | 5TPM = 5 × 64 = 320 | 5TPM = 5 × 64 = 320 | 640(ms) |
Shen et al. [28] | 3TPM = 3 × 64 = 192 | 3TPM = 3 × 64 = 192 | 384(ms) |
Zhang and Qi [26] | 2TPM = 2 × 64 = 128 | 1TPM = 1 × 64 = 64 | 192(ms) |
Farash et al. [7] | 2TPM = 2 × 64 = 128 | 1TPM = 1 × 64 = 64 | 192(ms) |
Proposed scheme | 1TPM = 1 × 64 = 64 | 1TPM = 1 × 64 = 64 | 128(ms) |