Comparison of Security Performance of NTRU and ECC Algorithms For RFID Authentication

^1,2,3 Faculty of Technology Information and Science Data, University Sebelas Maret, Surakarta, Indonesia
⁴ Faculty of Engineering, University Sebelas Maret, Surakarta, Indonesia

^a) bambang_harjito@staff.uns.ac.id
^b) fadhlimulyana20@student.uns.ac.id
^c) dwikosatriyo@gmail.com
^d) faisal_r@staff.uns.ac.id

Abstract

The rapid development of the Internet of Things creates information security vulnerabilities due to the unavoidable process of exchanging data. One device that is vulnerable to data security is RFID. One way to increase its security is to embed a cryptosystem in it. The NTRU algorithm can be a solution because of its low computational power. However, ECC is widely used because its computational power requirements are lower than other traditional public key algorithms. This research proposes the implementation and performance analysis of the ECC and NTRU algorithms on RFID devices. Testing is carried out by running 100-400 RFID devices simultaneously. The key generation and ECC decryption processes were faster than NTRU. The NTRU encryption process is faster than ECC. The ECC algorithm is more efficient and suitable for RFID devices. However, ECC is vulnerable to invalid curve attacks that can attack at the recommended security level. In NTRU, there is also a vulnerability to attacks using the LLL algorithm, but these attacks cannot yet attack the recommended security level. For this reason, the NTRU algorithm is more suitable for use on RFID devices, provided that the RFID device must increase its resources for computational needs heavier than ECC.