Design of an elliptic curve cryptoprocessor using optimal normal basis over GF(2233)

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.