Elliptic Curve Cryptography (ECC), an asymmetric-key cryptographic system, received extensive research and industry recognition owing to its reliable security with relatively smaller key sizes. It is most effective with resource-constrained applications. The very intensive function in ECC is point-multiplication. In this article, we propose a novel architecture for elliptic curve point-multiplication based on modified Lopez–Dahab–Montgomery(LDM) point-multiplication algorithm to achieve a reduction in hardware complexity and time complexity. The proposed architectural data-path is pipelined and organized to realize finite-field operations i.e., FF-multiplication and FF-square operations, in parallel to reduce the critical-path delay. The FF-operations are scheduled to perform each iteration of point-addition(PA) and point-doubling(PD) operations in eight clock-cycles without data-dependency. The elliptic curve-point-multiplication(ECPM) implementation over the National Institute of Standards and Technology(NIST) recommended binary curve GF($2^{163}$) shows that the proposed design achieves point-multiplication in $3.71\mathrm{\mu }\mathrm{s}$ utilizing 8529 LUTs on Xilinx Virtex-7 FPGA. In addition the design achieves an improvement of 36%, 32%, and 39% area-time efficiency when compared to the best existing designs in the literature when implemented over GF($2^{163}$), GF($2^{233}$) and GF($2^{283}$) respectively.

椭圆曲线密码术（ECC）是一种非对称密钥密码系统，由于其可靠的安全性和相对较小的密钥大小而受到了广泛的研究和行业认可。它对于资源受限的应用程序最有效。ECC中非常密集的功能是点乘法。在本文中，我们提出了一种基于改进的Lopez-Dahab-Montgomery（LDM）点乘法算法的椭圆曲线点乘法新架构，以降低硬件复杂度和时间复杂度。提出的体系结构数据路径经过流水线处理和组织，以并行实现有限域运算，即FF乘法和FF平方运算，以减少关键路径延迟。FF操作被安排为在八个时钟周期内执行加点（PA）和加倍（PD）操作的每个迭代，而无需依赖数据。美国国家标准技术研究院（NIST）推荐的椭圆曲线点乘法（ECPM）推荐二进制曲线GF（$2^{163}$）表明，所提出的设计实现了点乘法 $3。71\mathrm{\mu }\mathrm{s}$在Xilinx Virtex-7 FPGA上使用8529 LUT。此外，与通过GF实施的文献中最佳的现有设计相比，该设计的时空效率提高了36％，32％和39％。$2^{163}$），GF（$2^{233}$）和GF（$2^{283}$） 分别。