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.

有限域广泛用于现代密码体系结构中。基于突出有限域的对称和非对称密码系统是（ECC）椭圆曲线密码学，RSA，（AES）高级加密标准和基于配对的密码学。有限域的算术运算可以有效执行，满足设计空间约束和执行速度。这些目标解决了巨大的挑战，需要跨学科的努力才能提供最佳的算法，实现，体系结构和设计实践。该研究提出了一种方便的基于有限域算术的对称密钥密码系统，用于多媒体数据安全。该方案包括扩散和混乱。为了执行扩散阶段，随机数生成对于利用二进制Galois场扩展上的乘法和求逆运算至关重要。使用这些运算的主要目的是建立较少计算量的实质随机性。另外，已经为算法的混淆阶段部署了分组密码构造机制，与常规的分组密码相比，该算法生成了多个带有较少回合的S盒。因此，可以有效地在多媒体数据中产生混乱，从而提高安全性。实验结果和时间复杂度证明了该方案针对各种攻击的有效性。而且，由于在硬件和软件中快速且简单地实现了二进制有限字段，