Modified research on RFID-oriented ECC point multiplication over GF(2m) field

• Published in: 2016 IEEE International Conference on RFID Technology and Applications (RFID-TA) pp. 40 - 43
• Main Authors: Wei, Guoheng, Wang, Ya, Wu, Qiuhan
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-09-2016
• Subjects: Algorithm design and analysis; Clocks; Elliptic curve cryptography; Field programmable gate arrays; Hardware; Radiofrequency identification; Software algorithms
• DOI: 10.1109/RFID-TA.2016.7750747

In elliptic curve algorithm, point multiplication is the most core part. Its efficiency determines the execution efficiency of the algorithm. RFID label belongs to resource-constrained device, and it has strict requirement to hardware resource occupied by algorithm execution. Combined with the characteristics of RFID device, the paper modifies modular multiplication, modular inverse algorithm and applies overall serial and part parallel method to redesign algorithm execution structure and realizes it over FPGA. The result indicates that the algorithm compromises on the occupied area and execution speed, so it's suitable for RFID device.