Abstract

This paper presents the design of an elliptic curve cryptoprocessor using optimal normal basis. The scalar point multiplication is implemented using random curves over GF(2233), and the finite field multiplication is implemented using bit-serial and parallel multiplication algorithms. The designed processor is flexible, parameterized and described by using VHDL. This allows achieving a good trade-off between area, performance and flexibility. The execution times to carry out the scalar point multiplication of the designed cryptoprocessor using bit-serial and parallel multiplication were 1.62 μs and 0.025 μs, respectively. The performance results show that this cryptoprocessor can be used as a hardware coprocessor for high performance reconfigurable cryptosystems.

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 call

Disclaimer: 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.