Binary Galois field extensions dependent multimedia data security scheme

Abstract

Finite fields are widely used in modern cryptographic architecture. The prominent finite field based symmetric and asymmetric cryptosystems are (ECC) elliptic curve cryptography, RSA, (AES) advanced encryption standard and pairing-based cryptography. The arithmetic operations of a finite field performed efficiently, that meet the design space constraints and execution speed. These aims resolve tremendous challenges, which required interdisciplinary efforts to render the best algorithms, implementations, architectures, and design practices. This study proposes convenient finite field arithmetic based symmetric key cryptosystem for multimedia data security. The scheme is comprised of diffusion and confusion. To execute the diffusion phase the random numbers generation is essential in utilizing the multiplication and inversion operations over the binary Galois field extensions. The main objective of using these operations is to establish substantial randomness with less computational exertions. In addition, a block cipher construction mechanism has been deployed for the confusion phase of the algorithm which generates multiple S-boxes with fewer rounds as compared to the customary block ciphers. Therefore, efficient creation of confusion in multimedia data and hence more security is attained. The experimental results and the time complexity manifest the efficiency of the scheme against various attacks. Also, as a result of a fast and simple implementation of the binary finite field in hardware and software, the proposed cryptosystem is more convenient to implement as compared to the prevailing schemes.