A systolic architecture for elliptic curve cryptosystems

Abstract

This article presents a new systolic architecture for the main operation in an elliptic curve cryptosystem over the finite field GF(2(m)). This proposed architecture is actually a finite field multiplier and is used to implement the addition operation in the elliptic curs-e cryptosystem. We apply partitioning scheme and parallelize the main operation in a straightforward systolic architecture to speed up the operation and then apply merging and re-timing schemes in the partitioned architecture to future improve the performance of this architecture. We compare this architecture with some previously proposed systolic architectures for the finite field arithmetics. The comparison shows that our architecture offers the lowest hardware complexity. This architectures can be easily adopted to build a low-complexity elliptic curve cryptosystem.