Image Encryption Performance Evaluation Based on Poker Test

The fast development of image encryption requires performance evaluation metrics. Traditional metrics like entropy do not consider the correlation between local pixel and its neighborhood. These metrics cannot estimate encryption based on image pixel coordinate permutation. A novel effectiveness evaluation metric is proposed in this paper to address the issue. The cipher text image is transformed to bit stream. Then, Poker Test is implemented. The proposed metric considers the neighbor correlations of image by neighborhood selection and clip scan. The randomness of the cipher text image is tested by calculating the chi-square test value. Experiment results verify the efficiency of the proposed metrics

Cryptographic adaptation of the middle square generator

Currently, cryptography plays a major role in various computer and technological applications. With the high number of internet users, the use of cryptography to provide information security has become a priority. Several applications such as e-mails, electronic banking, medical databases and e-commerce require the exchange of private information. While, if the connection is not secure, this sensitive information can be attacked. The best-known cryptographic systems rely on the generation of random numbers, which are fundamental in various cryptographic applications such as key generation and data encryption. In what follows, we want to use pseudo-random sequences generated by the middle square generator. In this work, it must be possible to estimate that the data produced has random characteristics, knowing that the algorithm used is deterministic. Overall, this paper focuses on the testing of pseudo-random sequences generated by the middle square generator and its use in data encryption