期刊名称：International Journal on Computer Science and Engineering
印刷版ISSN：2229-5631
电子版ISSN：0975-3397
出版年度：2011
卷号：3
期号：02
页码：467-480
出版社：Engg Journals Publications
摘要：Modular inversion operation is known to be the most time consuming operation in ECC field arithmetic computations. In addition, Many ECC designs that use projective coordinates over GF (p) have not considered different factors that affect the design of ECC such as area, hardware utilization, cost (AT2) and performance factors which are crucial in many ECC applications. This paper proposes to use several projective coordinates to compute the standard ECC point doubling over GF (p) with no inversion operations due to the ability of projective coordinates to convert each inversion to several multiplication steps which are applied in parallel. We tune-up the mentioned factors by using a variable degree of parallelization benefiting from the inherent parallelism in ECC computations. The aim is to provide different design choices that can be utilized in several ECC applications. Out results show that projection (X/Z, Y/Z) gives the best results in terms of time-consuming using 5 parallel multipliers compared to other projections. Furthermore, both projections (X/Z, Y/Z) and (X/Z2, Y/Z3) achieve the highest hardware utilization enhancements when using 2 and 3 parallel multipliers respectively. A trade-off between factors such as security, area and time-consuming is which control the design of ECC, the more parallelization leads to less time-consuming. However, with extra area needed for parallel ECC operations.
关键词：Elliptic Curves Cryptography; Crypto-Architecture; Point Doubling; Projective Coordinates.
