An Innovative approach towards image encryption by using novel PRNs and S-boxes Modeling techniques

Efficient multiple pseudo-random number sequences (PRNS) and substitution boxes (S-boxes) are one of the most significant building blocks, which are jointly adopted normally for secure data encryption. Multiple aspects pave the way to handle large-scale multimedia data. However, the computational efforts on multiple constructions may certainly lead to limits the required ciphering through-put. Therefore, reducing the computational cost of multiple patterns such as PRNS and S-boxes is the core requirement for an efficient cryptosystem. For this achievement, we exploited the indexing technique over elliptic curves with small prime fields to introduce a computationally efficient mechanism for both multiple PRNS and multiple S-boxes. In the newly constructed PRNS and S-boxes, we used collectively EC group law and simple algebraic operations to get the security strength as well as low computational cost respectively. Based on statistical results, the proposed S-box mechanism is the most effective method that generates efficient multiple S-boxes on minimum prime fields. Likewise, the PRNS’s simulation results shows that the proposed mechanism is the highly effective model for generating multiple verified pseudo random patterns on small prime fields in a single round. These assessments indicates that the proposed mechanism offers desired key-space, better statistical features of encrypted data and less computational cost.