Security in Communication by Using Laplace
Security in Communication by Using Laplace
Abstract: In this paper we will show that how to increase the security in communication between two persons by using Laplace transform &
cryptography .In the first part of the paper we will consider one plain text (original message) and convert it to cipher text(text in hidden form) by applying
Laplace transform to trigonometric cosine function. In second part we will convert this cipher text to plain text by applying inverse Laplace transform.
Key-words: Laplace transform, Inverse Laplace transform, Cryptography, Plain text, cipher text, encryption, decryption
—————————— ——————————
k = + ( ) 6 2 28 1 2
7 4 14
By operating L.T. to (2) we will obtain one equation
having some new variable in denominator and some values
in the numerator (we call them as resulting values say ) From the above table (4.1) we may generalize the result on
adjusting these resulting values such that encryption given below.
we obtain which is our Theorem (3.1)
required cipher text. As decryption is the reverse process
of encryption we can obtain plain text by applying I.L.T. under the Laplace transform of can be converted
of * +. To determine cipher text by applying L.T. to cipher text where ( )( )
to trigonometric cosine function we may use the above and key is given by
method by considering some series of the form .
.
3. Example Let us consider one plain text Now we will convert the obtained cipher text in to plain text
by applying the same methodology.
given below Applying Inverse Laplace transform to equation (2) we have
R E L I A N C E and by methodology 1.1.6
we will convert this plain text to cipher First suppose by our
allotment given plain text be equivalent to * , -+ =34 [ ] [ ] [ ]
17 4 11 8 0 13 2 4 [ ] [ ] [ ] [ ]
Suppose that Let =11,
(1) [
] then we obtain the same equation (1)
Case 1.In this case by taking m=1&n=1 equation (1) plain text 17 4 11 8 0 13 2 4i.e.
becomes R E L I A N C E Hence in general we have
Kysiny=17 Theorem (3.2) The given cipher text With a given key
Can be converted to plain text under the I.L.T.
( )
Applying Laplace transform to both sides we have of , - =∑ where ( )[ ]
, - Where ,j
* + * }+ * + * }+ * + * + Case 2In this case by taking m=1&n=2 equation (1)
becomes
* +- * +
+
, -=
Let us assume that =
, , and we will obtain Operating Laplace transform to the above equation we
such that have
as follows , -
* + * }+ * + * }+ * +
{ }
* + - * +
,
0 17 34 1 8
1 4 10
2 11 66 2 14
,
3 8 14
Thus we have converted
4 0 0 0 0 given plain text
R E L I A N C E to cipher text i.e. in secret
5 13 6 0
form as
3208
IJSTR©2019
www.ijstr.org
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME 8, ISSUE 12, DECEMBER 2019 ISSN 2277-8616
5. References
0 17 68 3 [1] ]A.D. Poularika (McGraHill, 2000) Second edition
The Transforms and Applications Hand-book
1 4 [2] A.P. Hiwarekar: A new method of Cryptography
2 11 192 7 10 using Laplace transform of Hyperbolic function,
International Journal of Mathematical archive,
3 8 39 2013,4(2),pp.206-213
4 0 5120 197
[3] David M. Burton: Elementary number theory,
5 13
Seventh edition, McGraw Hill Education (India)
6 2 114688 4411 2
7 4 20165 2 Private Limited New Delhi.
[4] G. Naga Lakshmi, B. Ravikuar and A. Chandra
From the above table we may generalize the result on Sekher, A Cryptographic Scheme of Laplace
encryption and decryption given below. transforms, International Journal of Mathematical
Theorem(3.3) . archive, 2011, pp. 65-70
[5] G.A.Dhanorkar and A.P.Hiwarekar, A generalized
Then the given plain text in terms of can be transformed
Hill ciphers using Matrix transformation
to cipher text = by applying Laplace transform.
international Journal of Math.Sci and Engineering
to where
applications, Vol.5.no. 4(July 2011).pp. 19-23.
( ) ( ) and key is given by [6] Poularikas A.D., 1996. The transforms and
applications handbook, CRC Press, USA.
[7] Jaegar J.C. 1961, An Introduction to the Laplace
Theorem (3.4) The given cipher text , with a transformation with Engineering applications,
given key Can be converted to plain text under the Methuen London.
( ) [8] Johannes A. Buchmann, Introduction to
Inverse Laplace transform of , - =∑ Cryptography, Fourth Edition, Indian Reprint,
where Springer, (2009).
( ) [ ] Where ,
( ))
From the above two cases and derived theorems (2.1) to
(2.4) we make more generalization regarding encryption
and decryption as follows.
Theorem(3.5)
Then the given plaintext in terms of under the Laplace
transform of can be converted to cipher text
where
( ) ( )( ) ( ) and key
is given by
Theorem (3.6) The given cipher text , with a
given key Can be converted to plain text under the
( )
inverse Laplace transform of , - =∑
where
( ) [ ( )( ) (
]Where
)
,j
4. Conclusions
From the above theory part proved it is clear that by
changing values of m&n we will obtain different cipher texts
for given plain text which cannot be easily cracked without
providing some additional information. Thus Laplace
transform with cryptography plays an important role in
communication security.
5. Acknowledgements
3209
IJSTR©2019
www.ijstr.org