Implementation of finite fields and elliptic curves on a FPGA device

TL;DRAbstract

Nowadays, elliptic curve cryptosystems are widely distributed. Its fundamental operation is scalar multiplication kP, where P is a point of the elliptic curve and k an integer. Following the need for fast scalar multiplication, we decided for a hardware implementation on a FPGA device to achieve an adequate speed-up and increase in throughput. Hardware implementation is additionally simplified by the use of XOR gates for polynomial addition performed in GF(2m). Squaring turned out to be quite simple and low-cost as well. As one of the most common operations in finite field arithmetic, efficiently implemented multiplication can significantly improve performance of the entire design. Best results were achieved by using the hybrid Montgomery multiplier that was able to compute the product in just two clock cycles. Exponentiation was implemented by the square and multiply algorithm, where the use of a combinatiorial multiplication circuit gave the biggest gain in performance. The best met

Chat with Paper

AI Agents for this Paper