FPGA implementation of scalar multiplication over Fp for elliptic curve cryptosystem

Bellemou, Ahmed Mohamed; Akil, Mohamed; Benblidia, Nadjia; Issad, Mohamed

doi:10.1109/idt.2015.7396750

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words, these implementations are note suitable when less area consumption is targeted. Thus, in order to optimise and to adapt the execution of this operation to the data bus of microblaze processor, our method uses the modified high radix-r (r = 2 32 ) MMM algorithm (Bellemou et al, 2015;Issad et al, 2014). In fact, when long modulus are considered, the original MMM algorithm requires not only a long carry propagation paths and multipliers but also, a long registers to store the operands and the intermediate results., Therefore, SelectRAM blocks in the internal architecture of our AccMMM core are exploited to store the data instead of long registers.…”

Section: Introductionmentioning

confidence: 99%

Microblaze-based parallel implementations of elliptic curve scalar multiplication over Fp on FPGA

Bellemou

Benblidia

Akil

et al. 2020

IJITST

View full text Add to dashboard Cite

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 (F p ) 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.

show abstract

Section: Introductionmentioning

confidence: 99%