DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación
Artículo científico antes de ser publicado, versión del autor (Preprint)
Timing-Optimized Hardware Implementation to Accelerate Polynomial Multiplication in the NTRU Algorithm
Post-Quantum Cryptographic (PQC) algorithms have emerged to secure communication channels between electronic devices faced with the advent of quantum computers. The performance of PQC algorithms on embedded systems has to be evaluated in orderto achieve a good trade-off between required resources (area) and timing. This work presents two optimized implementations to speed up the NTRUEncrypt algorithm on a System-on-Chip (SoC). The strategy is based on accelerating the most time-consuming operation that is the truncated polynomial multiplication. Hardware dedicated modules for multiplication are designed by exploiting the presence of consecutive zeros in the coefficients of the blinding polynomial. The results are validated on a Pynq-Z2 platform that includes a Zynq-7000 SoC from Xilinx and supports a Python-based programming environment. The optimized version that exploits
the presence of double, triple, and quadruple consecutive zeros offers the best performance in timing, in addition to considerably reducing the possibility of an information leakage against an eventual attack on the device, making it practically negligible, This work was supported in part by TEC2017-83557-R project from Spanish Government and AT17 5926 USE from Junta de Andalucía, both with support from the P.O. FEDER of European Union, and LINKA20216 project from CSIC., Peer reviewed