Abstract
This paper describes an efficient hardware implementation of Elliptic Curve Cryptography (ECC) over GF(p). First it introduces an improved Montgomery modular multiplication method for efficient hardware implementation. The method velocity is faster compared to published implementations under equivalent cost. Then, the paper presents a fast mechanism of accelerating the elliptic curve point operation formulas by adopting modified Jacobian (Jm) coordinates. The modified formulas may reduce the number of multiplication in double procedure, so gain at total performance, because the double procedure appears often in point multiplication. The final result on VirtexII XC2V250 indicates the time of computing point multiplication of 256-bit ECC is 1.5 × 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-3</sup> s.
Sign-in/Register to access full text options 
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.
