Microblaze-based parallel implementations of elliptic curve scalar multiplication over Fp on FPGA. (20th January 2020)

• Record Type: Journal Article
• Authors: Bellemou, Ahmed Mohamed; Benblidia, Nadjia; Anane, Mohamed; Issad, Mohamed
• Is Part Of: International journal of internet technology and secured transactions. Volume 10:Number 1/2(2020)
• Page Start: 171
• Page End: 195
• Publication Date: 2020-01-20
• Subjects: embedded elliptic curve cryptosystem -- parallel scalar multiplication -- montgomery power ladder -- MPL -- projective coordinates system -- montgomery modular multiplication -- MPSoC -- FPGA; Internet -- Security measures -- Periodicals; Computer security -- Periodicals; Information systems management -- Security measures -- Periodicals; Computer networks -- Security measures -- Periodicals; Information technology -- Security measures -- Periodicals; 005.805
• Languages: English
• ISSNs: 1748-569X

Abstract

This paper presents flexible software/hardware parallel architectures for embedded elliptic curve cryptosystem (ECC) on FPGA as multi-processor system on programmable circuit (MPSoPC) design. The implementations perform elliptic curve scalar multiplication (ECSM) over arbitrary prime fields ( Fp ) using montgomery power ladder (MPL) algorithm and Chudnovsky projective system. Our aim is to achieve the best trade-off between flexibility, area and speed. In fact, the integration of multi Microblaze processors allows not only the flexibility of the overall system but also the exploitation of the parallelism in ECSM computation with several degrees. At the low abstraction level, the critical finite field operation which is Montgomery modular multiplication (MMM) is implemented in hardware Accelerator MMM (AccMMM) core based on the modified high radix- r ( r = 2 32 ) MMM algorithm. The proposed architectures have been implemented in Xilinx Virtex-5 FPGA. The execution times for performing 256-bit and 521-bit ECSM are 19.98 ms and 81.42 ms, respectively.