期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2013
卷号：50
期号：1
出版社：Journal of Theoretical and Applied
摘要：Recently Elliptic Curve Digital Signature Standard (ECDSA) is used for smart card applications and financial transaction applications, because it needs less memory space, low bandwidth, limited power, reuse and portability. So it is more suitable for wireless network applications. Normally it is implemented in two ways called as ECDSA over binary field GF (2n) for hardware applications and ECDSA over prime field GF (p) for software applications. It has two main computations. One is point addition and another point multiplication. In these operations, the point multiplication takes more execution time than point addition. Because the latency time of point multiplication is higher than point addition. So it is necessary to find out optimized implementation for point multiplication. This article suggests a technique for point multiplication over GF(2n) to increase the speed of the execution using concurrent computation.
关键词：ECDSA; Binary Field; Time complexity; latency time; parallel computation.
