scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

Elliptical Curve Cryptography for Images Using Fractal Based Multiple Key Hill Cipher

29 Mar 2018-pp 643-649
TL;DR: An improvised version of the Elliptical curve cryptography (ECC) with multiple keys generated by fractals used for the conversion of the symmetric Hill Cipher encryption to asymmetric, which has higher security.
Abstract: Ever since the evolution of time, there have been changes in the transmission and storage of images, but the only constants are the security issues that came along. Eavesdropping is the major pivotal security challenge and throughout the evolution of time even though many encryption methods are developed, the middlemen and hackers etc. also developed new methods, simultaneously, to sniff the information. In this process of eavesdropping, there are many different methods like chosen-cipher text attack, brute force attack etc. In order to cope up with these deficiencies, we proposed an improvised version of the Elliptical curve cryptography (ECC) with multiple keys generated by fractals. Keys which are generated by the combination of ECC and Fractals are used for the conversion of the symmetric Hill Cipher encryption to asymmetric, which has higher security. In order to measure the efficiency of proposed algorithm we have used the entropy, peak to signal noise ratio(PSNR), unified average changing intensity(UACI) and the correlation between pixels along horizontal, vertical and diagonal directions.
Citations
More filters
Proceedings ArticleDOI
01 Dec 2018
TL;DR: This paper is about a distinctive methodology by incorporation of a scheme that combines the use of dynamically generated keysets from grayscale images and a modified cipher that yields higher security as each keyset derives its key values from the respectivegrayscale image which are used iteratively in the modified algorithm.
Abstract: The susceptibility of conventional Caesar cipher as a tool for encryption is a known fact not only due to its simplicity but also its practical infeasibilities. The requirement in today's complex age is of a method which has higher effectiveness in terms of being immune to cryptanalysis and at the same time is simple to implement. This paper is about a distinctive methodology by incorporation of a scheme that combines the use of dynamically generated keysets from grayscale images and a modified cipher. The unique aspect proposed yields higher security as each keyset derives its key values from the respective grayscale image which are used iteratively in the modified algorithm. Every iteration in the algorithm makes use of a different key value from the keyset, producing a new cipher-text in each iteration. Cipher-text produced in every iteration is encrypted in the succeeding iteration. This process repeats until all key values are used to obtain a highly-encrypted form of cipher-text. Hence, this sequential and iterative approach is proposed as an effective solution for present-day requirements of information security.
References
More filters
Journal ArticleDOI
TL;DR: A robust image encryption algorithm is proposed based on DNA and ECDHE that can resist exhaustive attacks and is apt for practical applications.

169 citations


"Elliptical Curve Cryptography for I..." refers methods in this paper

  • ...P16384= [65; 71; 67; 72] By Hill Cipher algorithm Km*Pm=Cm (5) [1,6] [9,11] [18,5] [24,5] [1,25] [9,20] [18,26] [24,26] [3,8] [12,10] [20,5] [26,11] [3,23] [12,21] [20,26] [26,20] [4,3] [14,8] [21,4] [27,11] [4,28] [14,23] [21,27] [27,20] [5,3] [15,13] [22, 3] [28,2] [5,28] [15,18] [22,28] [28,29] [6,15] [17,2] [23,14] [30,1] [6,16] [17,29] [23,17] [30 30] Consider a fractal of ‘n’ points long depending upon the size of plain text to be encrypted...

    [...]

  • ...Reference [9] uses the Elliptic Curve Diffie–Hellman Encryption with DNA for RGB images with better key sensitivity....

    [...]

Journal ArticleDOI
TL;DR: A new image encryption technique that combines Elliptic Curve Cryptosystem with Hill Cipher (ECCHC) has been proposed in this paper to convert Hill cipher from symmetric technique to asymmetric one and increase its security and efficiency and resist the hackers.

67 citations


"Elliptical Curve Cryptography for I..." refers methods in this paper

  • ...Reference [11] combines two different cryptographies to convert symmetric encryption to asymmetric....

    [...]

  • ...P16384= [65; 71; 67; 72] By Hill Cipher algorithm Km*Pm=Cm (5) [1,6] [9,11] [18,5] [24,5] [1,25] [9,20] [18,26] [24,26] [3,8] [12,10] [20,5] [26,11] [3,23] [12,21] [20,26] [26,20] [4,3] [14,8] [21,4] [27,11] [4,28] [14,23] [21,27] [27,20] [5,3] [15,13] [22, 3] [28,2] [5,28] [15,18] [22,28] [28,29] [6,15] [17,2] [23,14] [30,1] [6,16] [17,29] [23,17] [30 30] Consider a fractal of ‘n’ points long depending upon the size of plain text to be encrypted...

    [...]

Journal ArticleDOI
TL;DR: The Modified Hill Cipher solves the drawbacks of conventional Hill ciphers by using iterations and interlacing, which eliminates necessity of matrix inverse while decryption.

11 citations


"Elliptical Curve Cryptography for I..." refers methods in this paper

  • ...Reference [4] this is taken to the next level with Hill Cipher modified with a non-singular involutory key matrix....

    [...]

  • ...P16384= [65; 71; 67; 72] By Hill Cipher algorithm Km*Pm=Cm (5) [1,6] [9,11] [18,5] [24,5] [1,25] [9,20] [18,26] [24,26] [3,8] [12,10] [20,5] [26,11] [3,23] [12,21] [20,26] [26,20] [4,3] [14,8] [21,4] [27,11] [4,28] [14,23] [21,27] [27,20] [5,3] [15,13] [22, 3] [28,2] [5,28] [15,18] [22,28] [28,29] [6,15] [17,2] [23,14] [30,1] [6,16] [17,29] [23,17] [30 30] Consider a fractal of ‘n’ points long depending upon the size of plain text to be encrypted...

    [...]

Journal ArticleDOI
TL;DR: A variant of hill cipher having two key matrices to add extra security to health related data is proposed, which is computationally feasible in achieving confidentiality.

9 citations


"Elliptical Curve Cryptography for I..." refers background in this paper

  • ...Reference[12] states that as increase in the technology there are different analysis to decrypt the image called crypt analysis means finding the plain text with help of the cipher text, as we know earlier seen that Hill cipher with ECC will perform encryption with only one key ,this causes serious issue during the image transmission....

    [...]

  • ...P16384= [65; 71; 67; 72] By Hill Cipher algorithm Km*Pm=Cm (5) [1,6] [9,11] [18,5] [24,5] [1,25] [9,20] [18,26] [24,26] [3,8] [12,10] [20,5] [26,11] [3,23] [12,21] [20,26] [26,20] [4,3] [14,8] [21,4] [27,11] [4,28] [14,23] [21,27] [27,20] [5,3] [15,13] [22, 3] [28,2] [5,28] [15,18] [22,28] [28,29] [6,15] [17,2] [23,14] [30,1] [6,16] [17,29] [23,17] [30 30] Consider a fractal of ‘n’ points long depending upon the size of plain text to be encrypted...

    [...]

01 Dec 2017
TL;DR: This paper discusses the encryption, compression and decryption of image using ECC on matlab as platform and gives various advantages of ECC over RSA such as low bandwidth usage, low computational time and small key size.
Abstract: Elliptic Curve Cryptography or Cryptosystem (ECC) is one of the public-key cryptosystem The main advantage and benefit of ECC instead of RSA is that it gives equivalent security by using smaller key then in RSA; thereby it consumes less number of resource and also less amount of memory There are various advantages of ECC over RSA such as low bandwidth usage, low computational time and small key size; it can also be used for image encryption Through this paper image encryption with using ECC is presented It discusses the encryption, compression and decryption of image using ECC on matlab as platform

8 citations


"Elliptical Curve Cryptography for I..." refers methods in this paper

  • ...Reference [10] uses ECC with Magic matrix notations which is capable to encrypt multimedia data....

    [...]

  • ...P16384= [65; 71; 67; 72] By Hill Cipher algorithm Km*Pm=Cm (5) [1,6] [9,11] [18,5] [24,5] [1,25] [9,20] [18,26] [24,26] [3,8] [12,10] [20,5] [26,11] [3,23] [12,21] [20,26] [26,20] [4,3] [14,8] [21,4] [27,11] [4,28] [14,23] [21,27] [27,20] [5,3] [15,13] [22, 3] [28,2] [5,28] [15,18] [22,28] [28,29] [6,15] [17,2] [23,14] [30,1] [6,16] [17,29] [23,17] [30 30] Consider a fractal of ‘n’ points long depending upon the size of plain text to be encrypted...

    [...]