Abstract

This work presents efficient hardware architectures for elliptic curves cryptoprocessors using polynomial and gaussian normal basis. The scalar point multiplication is implemented using random curves over GF(2233) and the Lopez-Dahab algorithm. In this case, the GF(2m) multiplication is implemented in hardware using three algorithms for polynomial basis (PB) and three for gaussian normal basis (GNB). The cryptoprocessors based on PB with D=32 and GNB with D=30 use 76 µs and 60 µs for scalar multiplication and 26697 and 18567 ALUTs, respectively. The compilation and synthesis results show that the GNB cryptoprocessor presents a better performance than PB cryptoprocessor. However, the last one is less complex and more scalable from the design point of view.

Full Text
Published version (Free)

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