Elliptical Curve Cryptography Design Principles

Abstract

The factors decomposition problem for large numbers and the discrete logarithm problem in finite field are two mathematical theories used in cryptography of public key. In recent public key cryptography, such as RSA cryptography, large-number factor decomposition problems are commonly exploited. RSA has had several issues with the advancement in processor hardware and fast computing technologies. With small public key, bandwidth of network is inadequate, and the capacity to withstand attack is excellent, the elliptic curve discrete logarithm problem is used in cryptography. The article delves into the strategy values of elliptic curve cryptography, the system's key insides, the steady elliptic curve collection process, and a thorough examination of its application.