Find in Library

Due to rapid development in secured technological devices, the efficient implementation of a large field-size elliptic curve cryptosystem (ECC) is becoming demanding in many critical applications. Therefore, this paper presents a new Montgomery point multiplication (PM) algorithm to optimize and balance the signal flow and resource utilization efficiency. Thereafter, we have presented an efficient ECC processor architecture over <inline-formula> <tex-math notation="LaTeX">$GF(2^{m})$ </tex-math></inline-formula> with m &#x003D; 409 and 571 for the proposed Montgomery PM algorithm. Finally, we have given a detailed comparison and performance analysis (in terms of area-delay product) to show that the proposed cryptographic processor has superior performance as compared to the competing designs. The implementation results after place &#x0026; route on Xilinx Virtex 7 and Kintex Ultrascale&#x002B; are provided. The achieved results reveal that the proposed large field-size ECC processor (and the proposed design strategy) can be extended and applied in many security-demanding applications.