FPGA Implementation of Elliptic Curve Encryption Algorithm Based on PUFs

Elliptic curve encryption algorithm has a wide range of applications in the field of blockchain and information security. The traditional elliptic curve encryption scheme stores the user private key in the system hardware. When an attacker obtains the user private key in some way, the user will face serious information security problems. To improve the security of the user private key, we propose to use the response of physical unclonable functions (PUFs) as the user private key. PUFs can reduce the risk of users’ private keys being acquired by attackers due to its characteristics of non-cloning, real-time reading and unpredictability. The longest operation in elliptic curve encryption algorithm is the dot product operation. In order to solve the problem of mismatch between PUFs response generation rate and point product operation, we optimize the structure of the underlying multiplier in the binary domain to effectively reduce the consumption of hardware resources and achieve faster point product operation. The experimental results show that when the key length is 233 bits, the system clock can reach 103MHz and the minimum time of single encryption operation is only 69.4$\mu$s on Xilinx Artix-7 FPGA.