An fpga-based elliptic curve scalar multiplication acceleration circuit and its algorithm

Abstract

The invention discloses an elliptic curve scalar multiplication acceleration circuit based on FPGA and an algorithm thereof. The circuit comprises an input module, a module for converting affine coordinates into projected coordinates, a main loop multiplication module, a module for converting projected coordinates into affine coordinates, an output module and a Clock control module; input parameters are passed through the input module to the affine coordinate converted to projected coordinate module, the main loop multiplication module and the projected coordinate converted to affine coordinate module; the affine coordinate converted to projected coordinate module passes the data to the main loop Multiplication module; the multiplication module of the main loop transmits the data to the projected coordinate into affine coordinate module; the projected coordinate is converted into affine coordinate module transmits the data to the output module; the clock control module is used to control the affine coordinate to be converted into the projected coordinate module, The main loop multiplication module and the projected coordinates are converted into the clock signal of the affine coordinate module. The invention obtains an execution circuit with better operation design on a finite field.

Description

technical field [0001] The invention belongs to the field of hardware acceleration of encryption algorithms, and in particular relates to an FPGA-based elliptic curve scalar multiplication acceleration circuit and an algorithm thereof. Background technique [0002] Elliptic Curve Cryptosystem (ECC) theory was independently proposed by Neal Koblitz and Victor Miller in 1985, and it is a kind of public key cryptosystem. The idea of ​​public key cryptography was proposed by Diffie and Hellman in 1976. Different from traditional private key cryptography, which uses substitution and replacement, it is based on the intractability of mathematical problems and requires keys to appear in pairs. One is an encryption key. key, and the other is the decryption key. The public key cryptosystem effectively solves the problems of key distribution, key management and non-repudiation faced by the traditional cryptosystem. The public key cryptosystem has a large amount of computation and is o...

AI Technical Summary

Problems solved by technology

Many existing FPGA-based ECC circuit designs do not combine encryption algorithms to make full use of the high parallelism of FPGAs, resulting in low efficiency, or serious consumption of hardware resources, and cannot be applied to devices with limited hardware resources.

Images