Abstract
Scalar multiplication is the most time consuming computation in elliptic curve cryptography (ECC). ECC coprocessors provide computational support for the scalar multiplication algorithm. In this paper, we propose an efficient multi-segment GF(2m) multiplication method and discuss its application for ECC. The proposed method is particularly effective when the underlying technology provides an efficient realization of dual-port RAM block structures. We implemented ECC coprocessors in FPGA development environments to compare the resource usages of the ECC processors which use the proposed multi-segment multipliers and others using the digit-serial multipliers. The experimental results show that the proposed multi-segment multiplication method requires significantly less FPGA resources for the same multiplication performance in ECC implementations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
