High speed arithmetic device and method of elliptic curve code

Abstract

The invention relates to a high speed arithmetic device and a method of elliptic curve codes. The invention mainly aims to a master curve, the elliptic curve of which is 160-256 bit of die length and the prime field of which is on Fp. The high speed arithmetic device is a special hardware structure based on a water running pulsate double modular multiplier; the hardware structure comprises an operation part, a control part and a storage part, wherein the operation part comprises two parallel water running pulsate modular multipliers and two groups of adders. Based on the specific hardware structure, point addition and point double water running operation sequences of modified Jacobi coordinate projective joints are rearranged, and point addition and point double operations which sequentially appear in succession are connected end to end; and the vacant times of the double modular multipliers are mutually complemented, thus increasing the hardware efficiency of the water running pulsate modular multipliers and causing the point addition operation to only occupy seven modular multiplication operation cycles and the point double operation to occupy four modular multiplication operation cycles, and drastically reducing clock periodic numbers of the point addition and / or point double and point multiplication operation.

Description

technical field [0001] The present invention generally relates to elliptic curve cryptography technology, and more specifically, relates to a high-speed operation method and integrated circuit of elliptic curve cryptography. Background technique [0002] 1. Elliptic curve cryptography [0003] In 1985, Koblitz and Victor Miller independently proposed the Elliptic Curves Cryptosystem (ECC for short), whose security is based on the Elliptic Curve Discrete Logarithm Problem (ECDLP for short). . [0004] In 1976, W. Diffie and M. Hellman proposed public key cryptography for the key distribution and management of symmetric cryptography. The first widely used public key cryptography is RSA proposed by R.Rivest, A.Shamir and L.Adleman. Its security is based on the mathematical problem of factoring large integers. The algorithmic time complexity of the large integer factorization problem involved in RSA is sub-exponential; the algorithmic time complexity of the discrete logarithm...

AI Technical Summary

Problems solved by technology

But so far, the performance of most of the computing devices about the elliptic curve cryptographic algorithm still does not meet the actual requirements, that is, the average point multiplication performance per second is all below 1000 times per second (here the modulus length on the prime field is 192 bits) The general elliptic curve is used as a reference, and it works at a frequency of 10MHz)

Images