The Research Of RFID Encryption System Based On Elliptic Curve Cryptography System

With the advent of the era of the IoT(Internet of Things), RFID technology has made many remarkable research achievements, it have been widely used in many fields. However, due to hardware resource-constrained electronic tag itself, but also because of the special non-contact between the reader and the tag, leading to the channel there is a big security risk, privacy and security of user data are difficult to be guaranteed. Currently the establishment of a complete set of RFID authentication mechanism to ensure the interests of users, because RFID tags under the conditions of the hardware resources are limited, the physical mechanism based security mechanism is difficult to achieve, more and more researchers set their sights on cryptography security mechanism.Elliptic curve cryptosystem (ECC, Elliptic Curves Cryptosystems) is a public key encryption system, not only have the same RSA algorithm functions, and higher safety performance, calculate the amount of smaller, faster, smaller storage space, bandwidth low, with more technical advantages, is very suitable for the current security certification needs of RFID technology, it has been widespread concern in many RFID technology security authentication mechanism and researchers. Because of the need for RFID security technology, traditional software encryption processing speed is difficult to meet the demand, the paper designed and implemented elliptic curve encryption processor in FPGA hardware resources, focuses on the improvement of elliptic curve encryption algorithm, the paper choose a domain as a binary finite field, respectively, on the design and implementation of the elliptic curve algorithm for binary finite field arithmetic modules, including modular addition, modular square, modular multiplication and modular inversion. For finite field modular multiplication module, using a modified Massey-Omura multiplier, improve operational efficiency, more suitable for modular design, For finite field modular inversion algorithm has been improved algorithm, reducing call finite field modulus and modulus squared module plus the number of modules to accelerate the speed of operation. Point multiplication algorithm as the core of elliptic curve encryption algorithm, which determines the speed of operation performance and resource utilization throughout the encryption processor, this paper several existing scalar algorithms for performance comparison, the final choice of Montgomery projective coordinate system algorithm as a scalar algorithms, in order to make points on the FPGA hardware resources to achieve better performance multiplication, using the improved algorithm Montgomery scalar multiplication module, designed and implemented scalar multiplication. Finally, the paper design of elliptic curve cryptography processors, respectively, with more references designed processor performance comparison, the paper processor designed in functionality and size have a strong advantage.