An efficient architecture for computing division over GF(/sup 2/m) in elliptic curve cryptography

In the computing system, division is normally programmed as an multiplication operation following with a multiplicative inversion process. It is the most time consuming operation in the computing of elliptic curve cryptography (ECC) for portable applications. This paper introduces a new architecture for hardware implementation of computing division based on the binary extended Euclidean algorithm. With the new architecture, ECC can be implemented with low power consumption and more computing efficiency for application in real-time system. In order to show the advantages, we also detail on the modified algorithm of our new architecture and compare the synthesis results of hardware implementations