Pseudo random sequences based on elliptic curve subgroups and mathematical model for its application to digital image security

The security strength of the elliptic curve cryptosystems (ECC) is due to its core operations-based group law. This aspect of the elliptic curve provides key service to ensure security against modern cryptanalysis. However, the excess use of group law in EC based algorithms make it computationally hard for real time applications. In this context, this paper presented a smart-like algorithm based on subgroup co-set operations. The suggested scheme uses all co-sets that generates multiple sequences that can smoothly be adopted in most promising communication architectures of the future such as internet of things (IoT). Besides, the subgroup structure on a small prime with possible embedding is managed to construct efficient substitution box (S-box). Whereas, the performance of the proposed S-box is examined via standardized tests thus found significant for multimedia data security applications. Moreover, a small prime based EC subgroup coset model is designed, that generates a set of experimentally verified independent pseudo random streams. The atypical mathematical model for its application to image data encryption is established, by combining the S-box module (SM) and subgroup coset module (ES-PM). Several statistical tests revealed that the proposed technique is suitable for various cryptographic applications.