FPGA Implementation of High-Efficiency ECC Point Multiplication Circuit
The authentication of Internet of Things (IoT) devices based on the Physical Unclonable Function (PUF) is widely adopted in the information security domain. However, the leakage of PUF responses in an authentication system reduces its privacy and security. To improve its security, we can utilize the...
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-05-01
|
| Series: | Electronics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2079-9292/10/11/1252 |
| _version_ | 1797532852283244544 |
|---|---|
| author | Xia Zhao Bing Li Lin Zhang Yazhou Wang Yan Zhang Rui Chen |
| author_facet | Xia Zhao Bing Li Lin Zhang Yazhou Wang Yan Zhang Rui Chen |
| author_sort | Xia Zhao |
| collection | DOAJ |
| description | The authentication of Internet of Things (IoT) devices based on the Physical Unclonable Function (PUF) is widely adopted in the information security domain. However, the leakage of PUF responses in an authentication system reduces its privacy and security. To improve its security, we can utilize the Elliptic Curve Cryptography (ECC) algorithm with different key lengths to encrypt the PUF response arbitrarily. Point multiplication is the most time-consuming operation in ECC because of its complex calculation process, which seriously affects the efficiency of the PUF response encryption. In order to solve this problem, a point multiplier based on binary field with reconfigurable key lengths of 233, 283, 409 and 571 is designed in this paper. In our method, by reusing the underlying computing units, the resources needed for point multiplication are effectively reduced. What it is more innovative is that double point multiplication operations with a key length of less than 283 bits can be performed simultaneously in the elaborate designed point multiplication circuit, which can effectively speed up the encryption process of ECC. The circuit is implemented on Xilinx Virtex-6 FPGA. The experiment results show the single point multiplication times of 233, 283, 409 and 571 key lengths are 19.33, 22.36, 41.36 and 56.5 μs, respectively, under the clock frequency of 135 MHz. In addition, it only needs 19.33 μs to perform two-point multiplication operations when the key length is 233 bits at the same time. When the key length is 283 bits, the point multiplication operation can be performed twice in 22.36 μs. |
| first_indexed | 2024-03-10T11:06:14Z |
| format | Article |
| id | doaj.art-4488507bf70f440ea3875cab3eb495a7 |
| institution | Directory Open Access Journal |
| issn | 2079-9292 |
| language | English |
| last_indexed | 2024-03-10T11:06:14Z |
| publishDate | 2021-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Electronics |
| spelling | doaj.art-4488507bf70f440ea3875cab3eb495a72023-11-21T21:08:13ZengMDPI AGElectronics2079-92922021-05-011011125210.3390/electronics10111252FPGA Implementation of High-Efficiency ECC Point Multiplication CircuitXia Zhao0Bing Li1Lin Zhang2Yazhou Wang3Yan Zhang4Rui Chen5School of Integrated Circuits, Southeast University, Nanjing 210096, ChinaSchool of Integrated Circuits, Southeast University, Nanjing 210096, ChinaSchool of Integrated Circuits, Southeast University, Nanjing 210096, ChinaSchool of Integrated Circuits, Southeast University, Nanjing 210096, ChinaSchool of Cyber Science and Engineering, Southeast University, Nanjing 210096, ChinaSchool of Computer and Software Engineering, Nanjing Vocational University of Industry Technology, Nanjing 210023, ChinaThe authentication of Internet of Things (IoT) devices based on the Physical Unclonable Function (PUF) is widely adopted in the information security domain. However, the leakage of PUF responses in an authentication system reduces its privacy and security. To improve its security, we can utilize the Elliptic Curve Cryptography (ECC) algorithm with different key lengths to encrypt the PUF response arbitrarily. Point multiplication is the most time-consuming operation in ECC because of its complex calculation process, which seriously affects the efficiency of the PUF response encryption. In order to solve this problem, a point multiplier based on binary field with reconfigurable key lengths of 233, 283, 409 and 571 is designed in this paper. In our method, by reusing the underlying computing units, the resources needed for point multiplication are effectively reduced. What it is more innovative is that double point multiplication operations with a key length of less than 283 bits can be performed simultaneously in the elaborate designed point multiplication circuit, which can effectively speed up the encryption process of ECC. The circuit is implemented on Xilinx Virtex-6 FPGA. The experiment results show the single point multiplication times of 233, 283, 409 and 571 key lengths are 19.33, 22.36, 41.36 and 56.5 μs, respectively, under the clock frequency of 135 MHz. In addition, it only needs 19.33 μs to perform two-point multiplication operations when the key length is 233 bits at the same time. When the key length is 283 bits, the point multiplication operation can be performed twice in 22.36 μs.https://www.mdpi.com/2079-9292/10/11/1252PUFelliptic curve encryption algorithmbinary fieldpoint multiplicationFPGA |
| spellingShingle | Xia Zhao Bing Li Lin Zhang Yazhou Wang Yan Zhang Rui Chen FPGA Implementation of High-Efficiency ECC Point Multiplication Circuit Electronics PUF elliptic curve encryption algorithm binary field point multiplication FPGA |
| title | FPGA Implementation of High-Efficiency ECC Point Multiplication Circuit |
| title_full | FPGA Implementation of High-Efficiency ECC Point Multiplication Circuit |
| title_fullStr | FPGA Implementation of High-Efficiency ECC Point Multiplication Circuit |
| title_full_unstemmed | FPGA Implementation of High-Efficiency ECC Point Multiplication Circuit |
| title_short | FPGA Implementation of High-Efficiency ECC Point Multiplication Circuit |
| title_sort | fpga implementation of high efficiency ecc point multiplication circuit |
| topic | PUF elliptic curve encryption algorithm binary field point multiplication FPGA |
| url | https://www.mdpi.com/2079-9292/10/11/1252 |
| work_keys_str_mv | AT xiazhao fpgaimplementationofhighefficiencyeccpointmultiplicationcircuit AT bingli fpgaimplementationofhighefficiencyeccpointmultiplicationcircuit AT linzhang fpgaimplementationofhighefficiencyeccpointmultiplicationcircuit AT yazhouwang fpgaimplementationofhighefficiencyeccpointmultiplicationcircuit AT yanzhang fpgaimplementationofhighefficiencyeccpointmultiplicationcircuit AT ruichen fpgaimplementationofhighefficiencyeccpointmultiplicationcircuit |