论文部分内容阅读
在椭圆曲线密码体制中,在FP域的运算是必不可少的。这里介绍了FP域的运算算法及特点,通过硬件描述语言VHDL完成了在FP域的模乘与模逆运算的设计。通过设计的优化,将模乘与模逆运算中所涉及的加法器、减法器以及比较器都转化为加法器予以实现,在没有改变实现速度的基础上节省了2/3的逻辑资源。通过Modelsim仿真工具,采用一种联合测试方法同时将模乘与模逆进行联合仿真,验证了设计的正确性。
In the elliptic curve cryptosystem, operations in the FP domain are essential. Here we introduce the algorithms and features of FP domain arithmetic, and implement the design of modular multiplication and inverse modular operations in the FP domain by hardware description language VHDL. By optimizing the design, adders, subtractors and comparators involved in the modulo and modular inverse operations are both converted into adders to achieve two-thirds of the logic resources without changing the speed of implementation. Through Modelsim simulation tools, a joint test method is used to simulate the model multiplication and module inverse simultaneously, which verifies the correctness of the design.