A Hardware Implementation of Point Scalar Multiplication on Edwards25519 Curve

This paper presents a design of a point scalar multiplier for Edwards curve cryptography (EdCC) based on Edwards25519 curve. For area-efficient implementation, finite field multiplier based on word-based Montgomery multiplication algorithm was designed, and the extended twisted Edwards coordinates system was adopted. The scalar multiplier requires 21,737 gate equivalent and 6.3 kbit RAM. It takes 950,000 clock cycles to calculate scalar multiplication, which is about 6 times faster than ECC processor based on conventional elliptic curves.