Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems
The advent of quantum computing with high processing capabilities will enable brute force attacks in short periods of time, threatening current secure communication channels. To mitigate this situation, post-quantum cryptography (PQC) algorithms have emerged. Among the algorithms evaluated by NIST i...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-06-01
|
| Series: | Cryptography |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2410-387X/7/2/29 |
| _version_ | 1797595395988127744 |
|---|---|
| author | Eros Camacho-Ruiz Macarena C. Martínez-Rodríguez Santiago Sánchez-Solano Piedad Brox |
| author_facet | Eros Camacho-Ruiz Macarena C. Martínez-Rodríguez Santiago Sánchez-Solano Piedad Brox |
| author_sort | Eros Camacho-Ruiz |
| collection | DOAJ |
| description | The advent of quantum computing with high processing capabilities will enable brute force attacks in short periods of time, threatening current secure communication channels. To mitigate this situation, post-quantum cryptography (PQC) algorithms have emerged. Among the algorithms evaluated by NIST in the third round of its PQC contest was the NTRU cryptosystem. The main drawback of this algorithm is the enormous amount of time required for the multiplication of polynomials in both the encryption and decryption processes. Therefore, the strategy of speeding up this algorithm using hardware/software co-design techniques where this operation is executed on specific hardware arises. Using these techniques, this work focuses on the acceleration of polynomial multiplication in the encryption process for resource-constrained devices. For this purpose, several hardware multiplications are analyzed following different strategies, taking into account the fact that there are no possible timing information leaks and that the available resources are optimized as much as possible. The designed multiplier is encapsulated as a fully reusable and parametrizable IP module with standard AXI4-Stream interconnection buses, which makes it easy to integrate into embedded systems implemented on programmable devices from different manufacturers. Depending on the resource constraints imposed, accelerations of up to 30–45 times with respect to the software-level multiplication runtime can be achieved using dedicated hardware, with a device occupancy of around 5%. |
| first_indexed | 2024-03-11T02:35:51Z |
| format | Article |
| id | doaj.art-73b26d7924da4249a0e54b74a20d4fad |
| institution | Directory Open Access Journal |
| issn | 2410-387X |
| language | English |
| last_indexed | 2024-03-11T02:35:51Z |
| publishDate | 2023-06-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Cryptography |
| spelling | doaj.art-73b26d7924da4249a0e54b74a20d4fad2023-11-18T09:55:40ZengMDPI AGCryptography2410-387X2023-06-01722910.3390/cryptography7020029Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded SystemsEros Camacho-Ruiz0Macarena C. Martínez-Rodríguez1Santiago Sánchez-Solano2Piedad Brox3Instituto de Microelectrónica de Sevilla, IMSE-CNM, CSIC/University of Seville, 41092 Seville, SpainInstituto de Microelectrónica de Sevilla, IMSE-CNM, CSIC/University of Seville, 41092 Seville, SpainInstituto de Microelectrónica de Sevilla, IMSE-CNM, CSIC/University of Seville, 41092 Seville, SpainInstituto de Microelectrónica de Sevilla, IMSE-CNM, CSIC/University of Seville, 41092 Seville, SpainThe advent of quantum computing with high processing capabilities will enable brute force attacks in short periods of time, threatening current secure communication channels. To mitigate this situation, post-quantum cryptography (PQC) algorithms have emerged. Among the algorithms evaluated by NIST in the third round of its PQC contest was the NTRU cryptosystem. The main drawback of this algorithm is the enormous amount of time required for the multiplication of polynomials in both the encryption and decryption processes. Therefore, the strategy of speeding up this algorithm using hardware/software co-design techniques where this operation is executed on specific hardware arises. Using these techniques, this work focuses on the acceleration of polynomial multiplication in the encryption process for resource-constrained devices. For this purpose, several hardware multiplications are analyzed following different strategies, taking into account the fact that there are no possible timing information leaks and that the available resources are optimized as much as possible. The designed multiplier is encapsulated as a fully reusable and parametrizable IP module with standard AXI4-Stream interconnection buses, which makes it easy to integrate into embedded systems implemented on programmable devices from different manufacturers. Depending on the resource constraints imposed, accelerations of up to 30–45 times with respect to the software-level multiplication runtime can be achieved using dedicated hardware, with a device occupancy of around 5%.https://www.mdpi.com/2410-387X/7/2/29hardware securitypost-quantum cryptographyNTRUembedded systemsresource-constrained devicesIoT |
| spellingShingle | Eros Camacho-Ruiz Macarena C. Martínez-Rodríguez Santiago Sánchez-Solano Piedad Brox Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems Cryptography hardware security post-quantum cryptography NTRU embedded systems resource-constrained devices IoT |
| title | Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems |
| title_full | Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems |
| title_fullStr | Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems |
| title_full_unstemmed | Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems |
| title_short | Timing-Attack-Resistant Acceleration of NTRU Round 3 Encryption on Resource-Constrained Embedded Systems |
| title_sort | timing attack resistant acceleration of ntru round 3 encryption on resource constrained embedded systems |
| topic | hardware security post-quantum cryptography NTRU embedded systems resource-constrained devices IoT |
| url | https://www.mdpi.com/2410-387X/7/2/29 |
| work_keys_str_mv | AT eroscamachoruiz timingattackresistantaccelerationofntruround3encryptiononresourceconstrainedembeddedsystems AT macarenacmartinezrodriguez timingattackresistantaccelerationofntruround3encryptiononresourceconstrainedembeddedsystems AT santiagosanchezsolano timingattackresistantaccelerationofntruround3encryptiononresourceconstrainedembeddedsystems AT piedadbrox timingattackresistantaccelerationofntruround3encryptiononresourceconstrainedembeddedsystems |