.png){kind=icon}
.png){kind=icon}
Return
P-MEC: Polynomial Congruence-Based Multimedia Encryption Technique Over Cloud
.png){kind=icon}
PRE
AI
DOI：10.1109/MCE.2020.3003127.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this multimedia era, the security of multimedia content over the Cloud becomes a crucial research area. There are several modes of communication available for transmitting the information over the Cloud from one place to another place around the globe. Such communication networks are open to all where anyone can access the data very easily. Therefore, the security of multimedia data over the Cloud becomes a major challenge. This study highlights better protection of multimedia content over Cloud in comparison to the existing approaches, where the information cannot be unwrapped in a reasonable time. The Strength of RSA, ElGamal, Diffie Hellman, and many more Cryptographic algorithms depend on the concept of congruence. As of now, the solution for linear and quadratic congruence had made its use limited, but this study had changed it by introducing the solution for Cubic and Polynomial congruence. The polynomial congruence concept has been used to encrypt the multimedia content. Based on the qualitative and quantitative experimental analysis, it can be concluded that the P-MEC model stands firm compared with the state-of-the-art models. The security analysis and experimental results display that the proposed scheme has strong robustness against statistical attack, vulnerability attack, and other comprehensive attacks.
Journal
IF:
4.1
Papers:
1.3K
Citations:
1.8K