Parallelizing GF (p) montgomery elliptic curve crypto-system operations to improve security and performance.

• Main Authors: Mohammad Alkhatib,, Jaafar, Azmi, Md Said, Mohamad Rushdan, Ahmad Zukarnain, Zuriati
• Format: Conference or Workshop Item
• Language: English; English
• Published: 2012
• Online Access: http://psasir.upm.edu.my/id/eprint/27312/1/ID%2027312.pdf; http://psasir.upm.edu.my/id/eprint/27312/; http://www.scientific.net/AMR

The elliptic curve crypto-system (ECC) performs two levels of computations, lower point operations, and upper scalar multiplication levels. The use of usual serial design and affine coordinates to apply ECC computations increases the time delay and weaken the security of the crypto-system against simple power attack (SPA). This work combines the inherited parallelism in both computation levels for GF (p) Montgomery ECC to improve performance and enhance the immunity of the ECC against SPA. Moreover, projective coordinates were used to apply ECC operations to eliminate the time-consuming inversion operation. In order to increase the speed even further, this paper proposes to use known NAF algorithm for scalar multiplication, as well as Montgomery multiplier to perform multiplication operations. Hardware implementations with target FPGA for GF (p) Montgomery ECC are also presented. The best performance level was achieved when parallelizing Montgomery ECC computations to eight parallel multipliers (PM) using homogeneous coordinates. Such strategy, although it requires extra resources, is worth considering due to its attractive security and performance conclusions.