Pauli half spinning and elliptic curve based information confidentiality mechanism (Q2239780)

The paper proposes a new data encryption scheme based on elliptic curves and Pauli spin half matrices. The proposed scheme is a hybrid one. Both parties agree on an elliptic curve \(y^2=x^3+ax+b\) over \(F_q\) with generator \(G\), generate random private keys w.r.t. the curve and share their public keys. The proposed algorithm in the next step uses a finite automata, more specifically a Moore machine mod 4, parametrized by 4x4 matrix \(M\) derived from a secret number \(k\) selected by Alice (a sending party), Alice's private key and publicly known EC parameters by applying a linear algebraic operations over \(F_q\). The output of the Moore machine is then taken as a basis for invertible 8x8 matrix \(K\) construction. Finally, the plaintext bytes are arranged into another 8x8 matrix \(P\) and the resulting ciphertext is given by \(C=KP\mod 256\). The new algorithm has been applied to encrypt digital images (see also [\textit{C. Rajvir} et al., ``Image encryption using modified elliptic curve cryptography and Hill cipher'', Smart innovation, systems and technologies 159, 675--683 (2020)]). The second part of the paper focuses on thorough analysis of image encryption. To determine the strength of the suggested scheme authors have performed different tests such as uniformity tests, NIST-based tests like randomness analysis, correlation analysis of pixels, information entropy analysis and also gray level co-occurrence matrix (GLCM) analysis, image distance analysis and histogram analysis. Differential analysis is discussed in detail to examine the sensitivity of offered encryption mechanism. Information entropy analysis indicates that the data is randomized, NPCR and UACI values [\textit{Y. Wu} et al., ``NPCR and UACI randomness tests for image encryption'', J. Select. Areas Telecommun. 1, No. 2, 31--38 (2011)] of the suggested scheme exhibits the strength against differential attacks.