Performance analysis of parallel modular multiplication algorithms for ECC in mobile devices
Authors: ARRUDA, T.V, VENTURINI, Y.R., SAKATA, T.C.
Number of views: 305
Modular multiplication is the main operation in Elliptic Curve Cryptography (ECC) on prime finite fields. It is executed most of the time and is costly because it requires a modular reduction and a multi-precision method. Therefore, its cost increases in proportion to the ECC's key size. It could be considered as a problem for mobile devices because, despite they have more resources nowadays, their performance is still limited. Moreover, processor devices' trends are multi-core, even in the case of mobile devices. All of these facts motivated us to investigate the performance of the parallel modular multiplication on a software level on a current mobile platform. Recent studies have shown that parallel modular multiplication is effective only with big key size, like ones required for RSA, but none of them have focused on mobile devices platform. In this article, we show that, even for a smaller key size, as required for ECC, the use of parallel modular multiplication guarantees a better performance on mobile devices.