提出了一种基于椭圆曲线的流水线实现方法,来解决串行计算的效率低下问题.通过分析椭圆曲线密码运算的数据相关性,在不增加模乘器面积的前提下,采用三级流水线,提高了椭圆曲线密码的运算速度,并给出适用于椭圆曲线密码VLSI设计的流水线的实现流程.
In this paper, a pipelining approach for elliptic curve cryptography is proposed to solve the problem of low efficiency in sequential implementation. Based on the data dependency in elliptic curve field operations, three-stage pipelining is adopted in the modular multiplier, which achieves a higher speed without adding areas. Furthermore, a pipelining flow is provided that is applicable for the VLSI design of elliptic curve cryptographic processor.