A novel technique of image encryption through projective coordinates of elliptic curve

被引:1
作者
Hafsa [1 ]
Rehman, Hafeez Ur [2 ]
Shah, Tariq [1 ]
Hummdi, Ali Yahya [3 ]
机构
[1] Department of Mathematics, Quaid-I-Azam University, Islamabad
[2] Department of Sciences and Humanities, National University of Computer and Emerging Sciences, KP, Peshawar
[3] Department of Mathematics, King Khalid University, Asir – Abha
关键词
Elliptic curve; Image encryption; Nonlinearity; Projective coordinates; Pseudo-Random Numbers; Substitution boxes;
D O I
10.1007/s11042-024-19598-7
中图分类号
学科分类号
摘要
Efficient multiple pseudo-random number sequences (PRNS) and substitution boxes (S-boxes) are two of the most consequential construction blocks jointly assumed commonly for secure data encryption. Multiple aspects pave the way to address large-scale multimedia data. However, the computational efforts on multiple constructions may limit the required ciphering. Therefore, reducing the computational cost of various patterns, such as PRNS and S-boxes, is the core requirement for an efficient cryptosystem. For this achievement, this article addresses the challenge of constructing secure S-boxes with enhanced nonlinearity (NL) and keyspace in image encryption. Our technique aims to bolster security in digital image encryption methods by prioritizing robustness over conventional complexity. We present a novel and efficient cryptosystem that utilizes Projective Coordinates (PCs) of Elliptic Curves (ECs) for encrypting digital images. Initially, we leverage the power of PCs of ECs over the set of integers modulo pr, where p is prime and r=9. Using ECs and applying trace mappings, we create optimal 8×8 S-boxes for pixel substitution in digital images. Moreover, the proposed scheme generates 2108 S-boxes in a single case of the proposed scheme. In addition, Pseudo-Random Numbers (PRNs) are generated from ECs over modulo pr to enhance security. Further, computational experiments demonstrate that our proposed cryptosystem offers superior protection against linear, differential, and statistical attacks compared to existing cryptosystems. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.
引用
收藏
页码:2651 / 2688
页数:37
相关论文
共 43 条
[1]  
Liu L., Zhang Z., Chen R., Cryptanalysis and improvement in a plaintext-related image encryption scheme based on hyper chaos, IEEE Access, 7, pp. 126450-126463, (2019)
[2]  
Miller V.S., Use of elliptic curves in cryptography, Conference on the Theory and Application of Cryptographic Techniques, pp. 417-426, (1985)
[3]  
Koblitz N., Elliptic curve cryptosystems, Math Comput, 48, 177, pp. 203-209, (1987)
[4]  
Koblitz N., Menezes A., Vanstone S., The state of elliptic curve cryptography, Des Codes Crypt, 19, pp. 173-193, (2000)
[5]  
Khan M., Asghar Z., A novel construction of substitution box for image encryption applications with Gingerbreadman chaotic map and S 8 permutation, Neural Comput Appl, 29, pp. 993-999, (2018)
[6]  
Rehman A.U., Khan J.S., Ahmad J., Hwang S.O., A new image encryption scheme based on dynamic s-boxes and chaotic maps, 3D Res, 7, pp. 1-8, (2016)
[7]  
Hussain I., Shah T., Gondal M.A., Khan M., Khan W.A., Construction of new S-box using a linear fractional transformation, World Appl Sci J, 14, 12, pp. 1779-1785, (2011)
[8]  
Hussain I., Shah T., Mahmood H., Gondal M.A., A projective general linear group based algorithm for the construction of substitution box for block ciphers, Neural Comput Appl, 22, pp. 1085-1093, (2013)
[9]  
Jamal S.S., Shah T., Attaullah A., A group action method for construction of strong substitution box, 3D Res, 8, pp. 1-10, (2017)
[10]  
Jahangir S., Shah T., Designing S-boxes triplet over a finite chain ring and its application in RGB image encryption, Multimed Tools Appl, 79, pp. 26885-26911, (2020)