Abstract
In this paper, we propose a high performance elliptic curve cryptographic processor over GF(2163). The proposed architecture is based on a modified Lopez-Dahab elliptic curve point multiplication algorithm and uses Gaussian normal basis (GNB) for GF(2163) field arithmetic. To achieve a high throughput rates, we design two new word- level arithmetic units over GF(2163) and derive a parallelized elliptic curve point doubling and point addition algorithm. We implement our design using Xilinx XC4VLX80 FPGA device which uses 24,263 slices and has a maximum frequency of 143 MHz. Our design is roughly 4.8 times faster with 2 times increased hardware complexity compared with the previous hardware implementation. Therefore, the proposed architecture is well suited to elliptic curve cryptosystems requiring high throughput rates such as network processors and Web servers.
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.
