Construction of a Matrix by an Elliptic Curve for Image Encryption

— So far, elliptic curves can give very efficient cryptographic systems thanks to the difficulty of the discrete logarithm problem on these curves. For this, in this article I will present a new method of cryptography based on the algebraic structure of such a curve defined on a finite field, where the problem of the discrete logarithm requires an exponential time for its resolution. Elliptic curves are applicable for key size because they allow smaller keys (256-bit) to provide security equivalent to the size of a 1024-bit RSA key that is based on several integer factoring algorithms.