A color image authenticated encryption using conic curve and Mersenne twister
- PDF / 2,674,061 Bytes
- 26 Pages / 439.37 x 666.142 pts Page_size
- 24 Downloads / 164 Views
A color image authenticated encryption using conic curve and Mersenne twister Roayat Ismail Abdelfatah 1 Received: 27 July 2019 / Revised: 14 May 2020 / Accepted: 22 May 2020 # Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract
A robust secure image transmission scheme has to achieve all the security services as confidentiality, authentication, integrity and nonrepudiation with a reasonable efficiency. An authenticated image encryption scheme which achieves all these services is proposed in this paper. The scheme uses pseudorandom sequence Public-key cryptosystem design based on factoring and discrete logarithmsenerated by Mersenne’s twister with XOR operation for image encryption and proposes two hard problems based digital signature: conic curve discrete logarithm problem (CCDLP) and Integer Factorization Problem (IFP) which achieves a highly secure system with efficient point operations and inverses. For efficient transmission, the image signature is embedded in the cipher image. Security analysis of the scheme is provided. According to the results, the proposed scheme is efficient and achieves an excellent long term security. Keywords Encryption . Signature . Conic curve . Messene’s twister
1 Introduction An efficient highly secure data transmission system has to protect information from unfriendly eyes and allows rapid and reliable communications. This target can be achieved by integrating a large number of technologies. The secrecy of the digital images requires maintaining the confidentiality, integrity, authentication and non-repudiation. The image encryption provides confidentiality [1]. DES, AES, RSA and El Gamal are examples of encryption schemes. These schemes are inefficient and consume long time for image encryption because of the characteristics of an image as redundancy and correlation between pixels. Different techniques are required to achieve the integrity, authentication and non-repudiation of data. To provide authentication, message authentication codes (MAC) are used [4, 54, 61, 63]. Integrity,
* Roayat Ismail Abdelfatah royat_esmaeel@f–eng.tanta.edu.eg; [email protected]
1
Electronics & Electrical Communications Department, Tanta University, Tanta, Egypt
Multimedia Tools and Applications
authentication and nonrepudiation of data can be achieved with public-key cryptography [25, 59, 64] known as digital signatures. In 1976, Diffie and Hellman introduced the first idea for the public key cryptography [20]. Then many digital signature algorithms have been proposed. Currently, most of digital signature schemes are based on one hard problem such as RSA which is based on integer factorization problem (IFP) and ElGamal digital signature scheme which is based on Discrete Logarithm Problem (DLP). Almost any cryptographic system, given enough time and resources can eventually be solved especially with the increasing power of attackers. Unfortunately, most of today’s digital signature schemes provide strong tools only for short term security. So the design of a
Data Loading...
