Fast computation of scalar multiplication over Binary Edwards Curve processor against side channel attack

Effective implementation of scalar multiplication is vital for Elliptic Curve Crypto-Processor over GF (2^m). They have problems in terms of unifiedness and completeness that is overcome by the Edwards Curve. In this paper, the scalar multiplication is done using Non Adjacent Form Algorithm (NAF). We illustrate parallelization in group operation level by utilizing unified addition formulas computation for Binary Edwards Curve (BEC). This decreases the number of field arithmetic operations, specifically multiplications, in the critical path by using many multipliers simultaneously. Also there is significant reduction in number of clock cycles and register resource at the expense of area usage. We estimate the LUT complexity and tradeoffs between time-area of the proposed BEC processor on FPGA. The results prove that the proposed BEC processor has better time performance compared to existing techniques.