An efficient hardware architecture of a scalable elliptic curve crypto-processor over GF(2n)
Lo’ai Tawalbeh, Alexandre Ferreira Tenca, Song Park, Çetin Kaya Koç · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2005
This paper presents a scalable Elliptic Curve Crypto-Processor (ECCP) architecture for computing the point multiplication for curves defined over the binary extension fields (GF(2n)). This processor computes modular inverse and Montgomery modular multiplication using a new effcient algorithm. The scalability feature of the proposed crypto-processor allows a fixed-area datapath to handle operands of any size. Also, the word size of the datapath can be adjusted to meet the area and performance requirements. On the other hand, the processor is reconfigurable in the sense that the user has the ability to choose the value of the field parameter (n). Experimental results show that the proposed crypto-processor is competitive with many other previous designs.