| Resumen |
A novel symmetric cryptosystem of the substitution permutation network type is presented for image encryption in 14 rounds. An algorithm is developed to generate 15 keys to encrypt images where each key is the image size. These keys are calculated using an elliptic curve with a constant zero value. The proposed curve is non-singular, non-supersingular, nor trace one. Chaos is employed to find a generating element in a cyclic subgroup and it is produced using the logistic map equation. In addition, a 16 x 16 substitution box is constructed using both chaos and an algorithm that defines a bijective function. The following tools are used in order to measure the degree of randomness of the encrypted figures: entropy, correlation, the discrete Fourier transform and a goodness-of-fit test with the chi-square distribution. Furthermore, an image size variable permutation is applied in the first round, and its inverse in the fourteenth. |
