High-Speed Novel Architecture Of Cryptography Using Finite Field Multiplier

Abstract

We proposed an efficient pipelined architecture of elliptic curve scalar multiplication (ECSM) over GF(2^m) in this paper. The architecture utilizes a multiplier accumulator (MAC) of bit-parallel finite field (FF) which depends on the algorithm of Karatsuba–Ofman. The algorithm of Montgomery ladder is improved for better allocating of execution paths.