Elliptical Curve Cryptography for Images Using Fractal Based Multiple Key Hill Cipher
Citations
References
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....
[...]
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...
[...]
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...
[...]
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...
[...]
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...
[...]