二进制域上的椭圆曲线加密解密算法建模与验证集成电路工程专业论文.docxVIP

Abstract Public-key cryptography was conceived in 1976 by Whitfield Diffie and Martin Hellman. The first practical realization followed in 1977 when Ron Rivest, Adi Shamir and Len Adleman proposed their now well-known RSA cryptosystem, in which security is based on the intractability of the integer factorization problem. Elliptic curve cryptography (ECC) was discovered in 1985 by Neal Koblitz and Victor Miller. Elliptic curve cryptographic schemes are public-key mechanisms that provide the same functionality as RSA schemes. However, their security is based on the hardness of a different problem, namely the elliptic curve discrete logarithm problem (ECDLP). Currently the best algorithms known to solve the ECDLP have fully exponential running time, in contrast to the subexponential-time algorithms known for the integer factorization problem. This means that a desired security level can be attained with significantly smaller keys in elliptic curve systems than is possible with their RSA counterparts. For example, it is generally accepted that a 160-bit elliptic curve key provides the same level of security as a 1024-bit RSA key. The advantages that can be gained from smaller key sizes include speed and efficient use of power, bandwidth, and storage. After introduction of applications and development of elliptic curves, this paper investigates ECC, characteristics of binary-field elliptic curves and the elliptic curve encryption and decryption algorithm, on the basis of which the architecture of the ECC system is determined. Then we model the F2233 elliptic curve encryption and decryption system and implement the binary fields addition, square, multiplication, and inverse using Verilog. With the above groundwork, we accomplish the scalar multiplication and the final elliptic curve encryption and decryption function. In the end, we construct the verification model and platform on which our design is validated with coverage metrics. At la