Application of Laplace Transform for

Cryptography

By: A.P. Hiwarekar

Presented by: Wudneh Tilahun

May 2017
Outline
1 Introduction
2 Definitions and Standard Results
The Laplace Transform
Some Standard Results of Laplace Transform:
3 Main Result
Encryption
Decryption
4 Encryption Algorithm
Discussion Examples
Implementation Strategies
5 Further Study
 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Introduction

1 In Today’s world, with increasing usage of computer

networks and internet, the importance of network,
computer and information security is obvious.
2 To be secured, information needs to be protected from
unauthorized access.
3 Hence, data security has become a critical and imperative
issue.
4 One of the widely used approaches for information security
is Cryptography.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 3 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Introduction

1 In Today’s world, with increasing usage of computer

networks and internet, the importance of network,
computer and information security is obvious.
2 To be secured, information needs to be protected from
unauthorized access.
3 Hence, data security has become a critical and imperative
issue.
4 One of the widely used approaches for information security
is Cryptography.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 3 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Introduction

1 In Today’s world, with increasing usage of computer

networks and internet, the importance of network,
computer and information security is obvious.
2 To be secured, information needs to be protected from
unauthorized access.
3 Hence, data security has become a critical and imperative
issue.
4 One of the widely used approaches for information security
is Cryptography.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 3 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Introduction

1 In Today’s world, with increasing usage of computer

networks and internet, the importance of network,
computer and information security is obvious.
2 To be secured, information needs to be protected from
unauthorized access.
3 Hence, data security has become a critical and imperative
issue.
4 One of the widely used approaches for information security
is Cryptography.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 3 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Introduction cont’d. . .

1 Cryptography, the mathematic of encryption, plays a vital

role in many fields.
2 Various techniques for cryptography are found in literature
[1-3, 5, 13, 18, 19].
3 Mathematical technique using matrices for the same are
found in Dhanorkar and Hiwarekar, [4]; Overbey,Traves and
Wojdylo, [15]; Saeednia, [17].
4 In Naga Lakshmi, Ravi Kumar and Chandra Sekhar, [7];
Hiwarekar, [9], [10], [11] and [12]; they encrypt a string by
using series expansion of f (t) and its Laplace transform.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 4 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Introduction cont’d. . .

1 Cryptography, the mathematic of encryption, plays a vital

role in many fields.
2 Various techniques for cryptography are found in literature
[1-3, 5, 13, 18, 19].
3 Mathematical technique using matrices for the same are
found in Dhanorkar and Hiwarekar, [4]; Overbey,Traves and
Wojdylo, [15]; Saeednia, [17].
4 In Naga Lakshmi, Ravi Kumar and Chandra Sekhar, [7];
Hiwarekar, [9], [10], [11] and [12]; they encrypt a string by
using series expansion of f (t) and its Laplace transform.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 4 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Introduction cont’d. . .

1 Cryptography, the mathematic of encryption, plays a vital

role in many fields.
2 Various techniques for cryptography are found in literature
[1-3, 5, 13, 18, 19].
3 Mathematical technique using matrices for the same are
found in Dhanorkar and Hiwarekar, [4]; Overbey,Traves and
Wojdylo, [15]; Saeednia, [17].
4 In Naga Lakshmi, Ravi Kumar and Chandra Sekhar, [7];
Hiwarekar, [9], [10], [11] and [12]; they encrypt a string by
using series expansion of f (t) and its Laplace transform.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 4 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Introduction cont’d. . .

1 Cryptography, the mathematic of encryption, plays a vital

role in many fields.
2 Various techniques for cryptography are found in literature
[1-3, 5, 13, 18, 19].
3 Mathematical technique using matrices for the same are
found in Dhanorkar and Hiwarekar, [4]; Overbey,Traves and
Wojdylo, [15]; Saeednia, [17].
4 In Naga Lakshmi, Ravi Kumar and Chandra Sekhar, [7];
Hiwarekar, [9], [10], [11] and [12]; they encrypt a string by
using series expansion of f (t) and its Laplace transform.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 4 / 33

 Introduction
Definitions and Standard Results
The Laplace Transform
Main Result
Some Standard Results of Laplace Transform:
Encryption Algorithm
Further Study

Definitions and Standard Results

Definition 2.1
Plain text signifies a message that can be understood by the
sender, the recipient and also by anyone else who gets an
access to that message.

Definition 2.2
When plain text message is codified using any suitable
scheme, the resulting message is called as cipher text.

Definition 2.3(a)
Encryption transforms a plain text message into cipher text,
whereas decryption transforms a cipher text message back into
plain text.
Presented by: Wudneh T. Application of Laplace Transform for Cryptography 5 / 33
 Introduction
Definitions and Standard Results
The Laplace Transform
Main Result
Some Standard Results of Laplace Transform:
Encryption Algorithm
Further Study

Definitions and Standard Results con’d . . .

Definition 2.3(b)
Every encryption and decryption process has two aspects: The
algorithm and the key. The key is used for encryption and
decryption that makes the process of cryptography secure.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 6 / 33

 Introduction
Definitions and Standard Results
The Laplace Transform
Main Result
Some Standard Results of Laplace Transform:
Encryption Algorithm
Further Study

The Laplace Transform:

If f (t) is a function defined for all positive values of t, then the

Laplace Transform of f (t) is defined as
Z ∞
L{f (t)} = F (s) = e−st f (t)dt (1)
0

provided that the integral exists. Here the parameter s is a real

or complex number. The corresponding inverse Laplace
transform is L−1 {F (s)} = f (t), [6, 8, 14, 16].

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 7 / 33

 Introduction
Definitions and Standard Results
The Laplace Transform
Main Result
Some Standard Results of Laplace Transform:
Encryption Algorithm
Further Study

The Laplace Transform: con’d . . .

Theorem 2.1
Laplace transform is a linear transform. That is, if
L{f1 (t)} = F1 (s); L{f2 (t)} = F2 (s); · · · ; L{fn (t)} = Fn (s) then

L{c1 f1 (t)+c2 f2 (t)+· · ·+cn fn (t)} = c1 F1 (s)+c2 F2 (s)+· · ·+cn Fn (s)

(2)
where c1 , c2 ; · · · ; cn are constants,[6,8,12,14].(2nd document)

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 8 / 33

 Introduction
Definitions and Standard Results
The Laplace Transform
Main Result
Some Standard Results of Laplace Transform:
Encryption Algorithm
Further Study

Some Standard Results of Laplace Transform:

In this presentation we are assuming that all the considered

functions are such that their Laplace transform exists. We are
also assuming that N be the set of natural numbers. Here we
require following standard results of Laplace transform
1 L{sinh kt} = k
s2 −k2
, L−1 { s2 −k
k
2 } = sinh kt (3)
2 s −1 s
L{cosh kt} = s2 −k2 , L { s2 −k2 } = cosh kt (4)
3 n!
L{tn } = sn+1 , L−1 { sn+1
n!
} = tn , n ∈ N (5)
 n  n
4 L{t f (t)} = ds F (s), sn+1 , L { −d
n −d n! −1
ds F (s)} = tn f (t)
(6)

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 9 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption

We consider standard expansion

∞
r3 t3 r5 t5 r7 t7 r2i+1 t2i+1 X (rt)2i+1
sinh rt = rt+ + + +· · ·+ +· · · =
3! 5! 7! (2i + 1)! i=0
(2i + 1)!
(7)
where r ∈ N is a constant, and
∞ 2i+1 2i+3
23 t5 25 t7 27 t9 22i+1 t2i+3 X 2 t
t2 sinh 2t = 2t3 + + + +· · ·+ +· · · =
3! 5! 7! (2i + 1)! i=0
(2i + 1)!
(8)
Similarly
∞ 2i 2i+1
r2 t3 r4 t5 r6 t7 r2i t2i+1 X r t
t cosh rt = t+ + + +· · ·+ +· · · =
2! 4! 6! (2i)! i=0
(2i)!
(9)
Presented by: Wudneh T. Application of Laplace Transform for Cryptography 10 / 33
 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

1 We allocated 0 to A and 1 to B then Z will be 25.

2 Let given message called plaintext be ’WUDNEH’, it is
equivalent to 22 20 3 13 4 7.
3 Let us assume that
G0,0 = 22, G1,0 = 20, G2,0 = 3, G3,0 = 13, G4,0 = 4, G5,0 =
7, Gn,0 = 0 for n ≥ 6.
4 Writing these numbers as a coefficients of t2 sinh 2t and
t cosh 2t
5 Assuming f (t) = Gt2 sinh 2t and g(t) = Gt cosh 2t, we get

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 11 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

1 We allocated 0 to A and 1 to B then Z will be 25.

2 Let given message called plaintext be ’WUDNEH’, it is
equivalent to 22 20 3 13 4 7.
3 Let us assume that
G0,0 = 22, G1,0 = 20, G2,0 = 3, G3,0 = 13, G4,0 = 4, G5,0 =
7, Gn,0 = 0 for n ≥ 6.
4 Writing these numbers as a coefficients of t2 sinh 2t and
t cosh 2t
5 Assuming f (t) = Gt2 sinh 2t and g(t) = Gt cosh 2t, we get

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 11 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

1 We allocated 0 to A and 1 to B then Z will be 25.

2 Let given message called plaintext be ’WUDNEH’, it is
equivalent to 22 20 3 13 4 7.
3 Let us assume that
G0,0 = 22, G1,0 = 20, G2,0 = 3, G3,0 = 13, G4,0 = 4, G5,0 =
7, Gn,0 = 0 for n ≥ 6.
4 Writing these numbers as a coefficients of t2 sinh 2t and
t cosh 2t
5 Assuming f (t) = Gt2 sinh 2t and g(t) = Gt cosh 2t, we get

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 11 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

1 We allocated 0 to A and 1 to B then Z will be 25.

2 Let given message called plaintext be ’WUDNEH’, it is
equivalent to 22 20 3 13 4 7.
3 Let us assume that
G0,0 = 22, G1,0 = 20, G2,0 = 3, G3,0 = 13, G4,0 = 4, G5,0 =
7, Gn,0 = 0 for n ≥ 6.
4 Writing these numbers as a coefficients of t2 sinh 2t and
t cosh 2t
5 Assuming f (t) = Gt2 sinh 2t and g(t) = Gt cosh 2t, we get

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 11 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

1 We allocated 0 to A and 1 to B then Z will be 25.

2 Let given message called plaintext be ’WUDNEH’, it is
equivalent to 22 20 3 13 4 7.
3 Let us assume that
G0,0 = 22, G1,0 = 20, G2,0 = 3, G3,0 = 13, G4,0 = 4, G5,0 =
7, Gn,0 = 0 for n ≥ 6.
4 Writing these numbers as a coefficients of t2 sinh 2t and
t cosh 2t
5 Assuming f (t) = Gt2 sinh 2t and g(t) = Gt cosh 2t, we get

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 11 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

For t2 sinh 2t

23 t3 25 t5 27 t7 29 t9 2

f (t) = t2 G0,0 2t + G1,0 + G2,0 + G3,0 + G4,0 + G5,0
3! 5! 7! 9!
∞ 2i+1 2i+3
X 2 t Gi,0
=
i=0
(2i + 1)!
2t3 23 t5 25 t7 27 t9 29 t11 211 t13
= 22 + 20 +3 + 13 +4 +7
1! 3! 5! 7! 9! (11)!
(10)
Taking Laplace transform on both sides of (10), we have

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 12 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

264 3200 4032 119808

L{f (t)} = L{Gt2 sinh 2t} = + 6 + 8 +
s4 s s s10
225280 1118208
+ +
s12 s14
(11)
Adding p = 5 to the resultant values
264 3200 4032 119808 225280 1118208
and then adjusting to mod 26 the given plain text string gets
converts to cipher text string Gi,1 , i = 0, 1, 2, 3, · · ·
9 7 7 5 21 5
Hence the given message string ’WUDNEH’ get converted to
’JHHFVF’ with key ki,1 for i = 0; 1; 2; 3; · · · ; as 10 123 155
4608 8664 43008.
Presented by: Wudneh T. Application of Laplace Transform for Cryptography 13 / 33
 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

Without adding any p value (taking p = 0) the resultant values

are
264 3200 4032 119808 225280 1118208
and adjusting to mod 26 the given plain text string gets
converts to cipher text string Gi,1 , i = 0, 1, 2, 3, · · ·
4 2 2 0 16 0
Hence the given message string ’WUDNEH’ get converted to
’ECCAQA’ with key ki,1 for i = 0; 1; 2; 3; · · · ; as 10 123 155
4608 8664 43008.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 14 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

These results can be generalized in the following theorem

Theorem 3.1
The given plain text in terms of Gi,0 , i = 0, 1, 2, 3, · · · under
Laplace transform of Gt2 sinh 2t, (that is by writing them as a
coefficients of t2 sinh 2t , and then taking the Laplace transform)
can be converted to cipher text

Gi,1 = (22i+1 (2i + 2)(2i + 3)Gi,0 + p)mod26 = qi,1 − 26ki,1 , (12)

f ori = 0, 1, 2, 3, · · ·
where

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 15 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

Theorem 3.1 cont’d. . .

qi,1 = 22i+1 (2i+2)(2i+3)Gi,0 +p, i = 0, 1, 2, · · · , p ∈ N, 0 ≤ p ≤ 25

(13)
and a key
qi,1 − Gi,1
ki,1 = f ori = 0, 1, 2, 3, · · · (14)
26
Now we apply the same operation again on the output of the
resulting cipher text obtained in the Theorem 3.1 and obtain its
new form which is included in the following theorem.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 16 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

Theorem 3.2
The given plain text in terms of Gi,1 , i = 1, 2, 3, · under Laplace
transform of Gi,1 t2 sinh 2t, (that is by writing them as a
coefficients of t2 sinh 2t and then taking the Laplace transform)
can be converted to cipher text

Gi,2 = (22i+1 (2i + 2)(2i + 3)Gi,1 + p)mod26 = qi,2 − 26ki,2 , (15)

f ori = 0, 1, 2, 3, · · ·
where

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 17 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

Theorem 3.2 cont’d. . .

qi,2 = 22i+1 (2i+2)(2i+3)Gi,1 +p, i = 0, 1, 2, · · · , p ∈ N, 0 ≤ p ≤ 25

(16)
and a key
qi,2 − Gi,2
ki,2 = f ori = 0, 1, 2, 3, · · · (17)
26
Now we apply such operations successively j times on the
given plain text and obtain its new form as cipher text. This
iterative method is included in the following theorem.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 18 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

Theorem 3.3
The given plain text in terms of Gi,0 , i = 1, 2, 3, · under Laplace
transform of Gi,0 t2 sinh 2t, successively j times(that is by writing
them as a coefficients of t2 sinh 2t and then taking the Laplace
transform successively) can be converted to cipher text

Gi,j = (22i+1 (2i+2)(2i+3)Gi,j−1 +p)mod26 = qi,j −26ki,j , (18)

f ori, j = 0, 1, 2, 3, · · ·
where

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 19 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Encryption cont’d. . .

Theorem 3.3 cont’d. . .

qi,j = 22i+1 (2i+2)(2i+3)Gi,j−1 +p, i, j = 0, 1, 2, · · · , p ∈ N, 0 ≤ p ≤ 25

(19)
and a key
qi,j − Gi,j
ki,j = f ori, j = 0, 1, 2, 3, · · · (20)
26

Remark 3.1
Theorem 3.1 is a special case of Theorem 3.3 with j = 1 and
Theorem 3.2 with j = 2.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 20 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption

1 For the decryption of the received cipher text we proceed

exactly in the reverse direction using inverse Laplace
transform. The method is as follows.
2 Suppose we have received message as ’JHHFVF’ which is
equivalent to 9 7 7 5 21 5
3 Let us assume that G0,1 = 9, G1,1 = 7, G2,1 = 7, G3,1 =
5, G4,1 = 21, G5,1 = 5, Gn,1 = 0f orn ≥ 6.
4 Using given key ki,0 , i = 0, 1, 2, 3, · · · as 10 123 155
4608 8664 43008 and p = 5, assuming

qi,1 = Gi,1 + 26ki,1 − p, i = 0, 1, 2, 3, · · · (21)

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 21 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption

1 For the decryption of the received cipher text we proceed

exactly in the reverse direction using inverse Laplace
transform. The method is as follows.
2 Suppose we have received message as ’JHHFVF’ which is
equivalent to 9 7 7 5 21 5
3 Let us assume that G0,1 = 9, G1,1 = 7, G2,1 = 7, G3,1 =
5, G4,1 = 21, G5,1 = 5, Gn,1 = 0f orn ≥ 6.
4 Using given key ki,0 , i = 0, 1, 2, 3, · · · as 10 123 155
4608 8664 43008 and p = 5, assuming

qi,1 = Gi,1 + 26ki,1 − p, i = 0, 1, 2, 3, · · · (21)

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 21 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption

1 For the decryption of the received cipher text we proceed

exactly in the reverse direction using inverse Laplace
transform. The method is as follows.
2 Suppose we have received message as ’JHHFVF’ which is
equivalent to 9 7 7 5 21 5
3 Let us assume that G0,1 = 9, G1,1 = 7, G2,1 = 7, G3,1 =
5, G4,1 = 21, G5,1 = 5, Gn,1 = 0f orn ≥ 6.
4 Using given key ki,0 , i = 0, 1, 2, 3, · · · as 10 123 155
4608 8664 43008 and p = 5, assuming

qi,1 = Gi,1 + 26ki,1 − p, i = 0, 1, 2, 3, · · · (21)

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 21 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption

1 For the decryption of the received cipher text we proceed

exactly in the reverse direction using inverse Laplace
transform. The method is as follows.
2 Suppose we have received message as ’JHHFVF’ which is
equivalent to 9 7 7 5 21 5
3 Let us assume that G0,1 = 9, G1,1 = 7, G2,1 = 7, G3,1 =
5, G4,1 = 21, G5,1 = 5, Gn,1 = 0f orn ≥ 6.
4 Using given key ki,0 , i = 0, 1, 2, 3, · · · as 10 123 155
4608 8664 43008 and p = 5, assuming

qi,1 = Gi,1 + 26ki,1 − p, i = 0, 1, 2, 3, · · · (21)

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 21 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption cont’d. . .

1 We consider
2
−d 2 264 3200 4032 119808 225280

= 4 + 6 + 8 + +
ds (s2 2
−2 ) s s s s10 s12
n
1118208 X qi,1
+ 14
= .
s i=0
s2i+4
(22)
2 Taking inverse Laplace transform we get

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 22 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption cont’d. . .

1 We consider
2
−d 2 264 3200 4032 119808 225280

= 4 + 6 + 8 + +
ds (s2 2
−2 ) s s s s10 s12
n
1118208 X qi,1
+ 14
= .
s i=0
s2i+4
(22)
2 Taking inverse Laplace transform we get

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 22 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption cont’d. . .

2t3 23 t5 25 t7 27 t9
f (t) = Gt2 sinh 2t = 22 + 20 +3 + 13
1! 3! 5! 7!
29 t11 211 t13
+4 +7
9! 11!
23 t3 25 t5 27 t7

2
= t G0,0 2t + G1,0 + G2,0 + G3,0
3! 5! 7!
9
2 t 9 11
2 t 11 13
2 t 13 215 t15

+ G4,0 + G5,0 + G6,0 + G7,0
9! 11! 13! 15!
(23)

1 Here we have G0,0 = 22, G1,0 = 20, G2,0 = 3, G3,0 =

13, G4,0 = 4, G5,0 = 7, Gn,0 = 0 for n ≥ 6.
Presented by: Wudneh T. Application of Laplace Transform for Cryptography 23 / 33
 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption cont’d. . .

2t3 23 t5 25 t7 27 t9
f (t) = Gt2 sinh 2t = 22 + 20 +3 + 13
1! 3! 5! 7!
29 t11 211 t13
+4 +7
9! 11!
23 t3 25 t5 27 t7

2
= t G0,0 2t + G1,0 + G2,0 + G3,0
3! 5! 7!
9
2 t 9 11
2 t 11 13
2 t 13 215 t15

+ G4,0 + G5,0 + G6,0 + G7,0
9! 11! 13! 15!
(23)

1 Here we have G0,0 = 22, G1,0 = 20, G2,0 = 3, G3,0 =

13, G4,0 = 4, G5,0 = 7, Gn,0 = 0 for n ≥ 6.
Presented by: Wudneh T. Application of Laplace Transform for Cryptography 23 / 33
 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption cont’d. . .

Here message 22 20 3 13 4 7 is equivalent to ’WUDNEH’. Thus

’JHHFVF’ under inverse Laplace transform gets converted to
’WUDNEH’.Hence we have following decryption theorem
Theorem 4.1
The given cipher text in terms of Gi,1 , i = 1, 2, 3, · · · with a given
key ki,0 , i = 0, 1, 2, 3, · · · can be converted to plain text Gi,0
under the inverse Laplace transform of
2 n
−d 2 qi,0
 X
G = . (24)
ds (s − 2 ) i=0 s2i+4
2 2

where

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 24 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption cont’d. . .

26ki,0 + Gi,1 − p
Gi,0 = 2i+1
,i = 0, 1, 2, · · · , p ∈ N, 0 ≤ p ≤ 25
2 (2i + 2)(2i + 3)
(25)
and
qi,0 = 26ki,0 + Gi,1 , i = 0, 1, 2, 3, · · · (26)
The generalized iterative theorem can be obtained on the
similar way which is included in the following

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 25 / 33

 Introduction
Definitions and Standard Results
Encryption
Main Result
Decryption
Encryption Algorithm
Further Study

Decryption cont’d. . .

Theorem 4.2
The given cipher text in terms of Gi,j , i, j = 1, 2, 3, · · · with a
given key ki,j−1 , I, j = 1, 2, 3, · · · can be converted to plain text
Gi,j−1 under the inverse Laplace transform of
2 n
−d 2 qi,j−1
 X
G = . (27)
ds (s − 2 ) i=0 s2i+4
2 2

where
26ki,j−1 + Gi,j − p
Gi,j−1 = , i, j = 1, 2, · · · , p ∈ N, 0 ≤ p ≤ 25
22i+1 (2i + 2)(2i + 3)
(28)
and
Presented by: Wudneh T. Application of Laplace Transform for Cryptography 26 / 33
 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Encryption Algorithm

1 Treat every letter in the plain text message as a number so

that A = 0, B = 1, C = 2, · · · , Z = 25.
2 The plain text message Gi,0 is organized as a finite
sequence of numbers, based on the above conversion.
Only consider Gi,0 till the length of input string, i.e. i = 1 to
n − 1.
3 Consider suitable function f (t) as in Theorem 3.3. Take
successive Laplace transform and get formula (18) for
encryption and choose suitable values of r, j, p. Hence
each character in the input string converts to new position
Gi,j .

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 27 / 33

 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Encryption Algorithm

1 Treat every letter in the plain text message as a number so

that A = 0, B = 1, C = 2, · · · , Z = 25.
2 The plain text message Gi,0 is organized as a finite
sequence of numbers, based on the above conversion.
Only consider Gi,0 till the length of input string, i.e. i = 1 to
n − 1.
3 Consider suitable function f (t) as in Theorem 3.3. Take
successive Laplace transform and get formula (18) for
encryption and choose suitable values of r, j, p. Hence
each character in the input string converts to new position
Gi,j .

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 27 / 33

 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Encryption Algorithm

1 Treat every letter in the plain text message as a number so

that A = 0, B = 1, C = 2, · · · , Z = 25.
2 The plain text message Gi,0 is organized as a finite
sequence of numbers, based on the above conversion.
Only consider Gi,0 till the length of input string, i.e. i = 1 to
n − 1.
3 Consider suitable function f (t) as in Theorem 3.3. Take
successive Laplace transform and get formula (18) for
encryption and choose suitable values of r, j, p. Hence
each character in the input string converts to new position
Gi,j .

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 27 / 33

 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Encryption Algorithm cont’d. . .

1 Key values Ki,j for every character can be obtained by

equation (20) using (19)
2 Send Gi,j−1 and Ki,j as well as r,j, p to the receiver.
3 On similar way we can also obtain decryption algorithm.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 28 / 33

 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Encryption Algorithm cont’d. . .

1 Key values Ki,j for every character can be obtained by

equation (20) using (19)
2 Send Gi,j−1 and Ki,j as well as r,j, p to the receiver.
3 On similar way we can also obtain decryption algorithm.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 28 / 33

 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Encryption Algorithm cont’d. . .

1 Key values Ki,j for every character can be obtained by

equation (20) using (19)
2 Send Gi,j−1 and Ki,j as well as r,j, p to the receiver.
3 On similar way we can also obtain decryption algorithm.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 28 / 33

 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Discussion Examples

Using results obtained in Theorem 3.3, if we have original

message ’WUDNEH’, then try to convert for
1 r=2, j=3, p=5,
2 r=2, j=4, p=5,
3 r=3, j=5, p=7,
4 r=3, j=4, p=6,
5 r=4, j=6, p=12,

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 29 / 33

 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Implementation Strategies

1 The main advantage of this algorithm is for same input

alphabets we can get different output alphabets. We just
need to change vale of r or j or p or all of them (in theorem
3.3).
2 If we consider encryption of one complete document then
we can choose different values of ‘r’ (in Theorem 3.3) for
different blocks. For each block chose different value of r
so that by any way attacker cracked one block he will not
be able to crack other blocks. We can also apply iterative
method in some cases.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 30 / 33

 Introduction
Definitions and Standard Results
Discussion Examples
Main Result
Implementation Strategies
Encryption Algorithm
Further Study

Implementation Strategies

1 The main advantage of this algorithm is for same input

alphabets we can get different output alphabets. We just
need to change vale of r or j or p or all of them (in theorem
3.3).
2 If we consider encryption of one complete document then
we can choose different values of ‘r’ (in Theorem 3.3) for
different blocks. For each block chose different value of r
so that by any way attacker cracked one block he will not
be able to crack other blocks. We can also apply iterative
method in some cases.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 30 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Further Study

Any interested scholar can extend this work as follows

1 Can develop software app for Encryption and Decryption
with computer scientists.
2 Can obtain similar results by using Laplace transform of
another suitable function rather than t2 sinh 2t.
3 Can work on Amharic or other languages.
4 Can also use different mathematical techniques for
Encryption and Decryption, eg. Fourier transform.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 31 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Further Study

Any interested scholar can extend this work as follows

1 Can develop software app for Encryption and Decryption
with computer scientists.
2 Can obtain similar results by using Laplace transform of
another suitable function rather than t2 sinh 2t.
3 Can work on Amharic or other languages.
4 Can also use different mathematical techniques for
Encryption and Decryption, eg. Fourier transform.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 31 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Further Study

Any interested scholar can extend this work as follows

1 Can develop software app for Encryption and Decryption
with computer scientists.
2 Can obtain similar results by using Laplace transform of
another suitable function rather than t2 sinh 2t.
3 Can work on Amharic or other languages.
4 Can also use different mathematical techniques for
Encryption and Decryption, eg. Fourier transform.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 31 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

Further Study

Any interested scholar can extend this work as follows

1 Can develop software app for Encryption and Decryption
with computer scientists.
2 Can obtain similar results by using Laplace transform of
another suitable function rather than t2 sinh 2t.
3 Can work on Amharic or other languages.
4 Can also use different mathematical techniques for
Encryption and Decryption, eg. Fourier transform.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 31 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

[1] Stanoyevitch A. Introduction to cyrptography with

mathematical foundations and computer implementations,
CRC Press, 2002.
[2] Barr TH. Invitation to Cryptography, Prentice Hall, 2002.
[3] Blakley GR. Twenty years of Cryptography in the open
literature, Security and Privacy. Proceedings of the IEEE
Symposium, 9-12 May,1999.
[4] Dhanorkar GA, Hiwarekar AP. A generalized Hill cipher
using matrix transformation. International J. of Math. Sci. &
Engg. Appls 2011; 5(IV): 19-23.
[5] Eric C, Ronald K., James WC. Netwark SecurityBible
Second edn.,Wiley India pub. 2009.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 33 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

[6] Kreyszing E. Advanced Engineering Mathematics, John

Wiley and Sons Inc.1999.
[7] Lakshmi GN, Kumar BR, Sekhar AC. A cryptographic
scheme of Laplace transforms. International Journal of
Mathematical Archive-2, 2011; 2515-2519.
[8] Grewal BS. Higher Engineering Mathematics, Khanna Pub.,
Delhi, 2005.
[9] Hiwarekar AP. A new method of cryptography using Laplace
transform. International Journal of Mathematical Archive
2012; 3(3): 1193-1197.
[10] Hiwarekar AP. A new method of cryptography using
Laplace transform of hyperbolic functions. International
Journal of Mathematical Archive 2013; 4(2): 208-213.
Presented by: Wudneh T. Application of Laplace Transform for Cryptography 33 / 33
 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

[11] Hiwarekar AP. Application of Laplace Transform for

Cryptographic Scheme. Proceeding of World Congress on
Engineering 2013; II, LNCS, 95-100.
[12] Hiwarekar AP. New Mathematical Modeling for
Cryptography. Journal of Information Assurance and
Security, MIR Lab USA, 2014; 9: 027-033.
[13] Buchmann JA. Introduction to Cryptography,Fourth Edn.,
Indian Reprint, Springer, 2009.
[14] Debnath L, Bhatta D. Integrl Transforms and Their
Applications, Chapman and Hall/CRC, First Indian edn.,
2010.
[15] Overbey J, Traves W, Wojdylo J. On the Keyspace of the
Hill Cipher, Cryptologia, 2005; 29: 59-72.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 33 / 33

 Introduction
Definitions and Standard Results
Main Result
Encryption Algorithm
Further Study

[16] Ramana BV. Higher Engineering Mathematics,Tata

McGraw-Hills, 2007.
[17] Saeednia S. How to Make the Hill Cipher Secure.
Cryptologia 2000; 24: 353-360.
[18] Stallings W. Cryptography and network security, 4th
edition, Prentice Hall, 2005.
[19] Stallings W. Network security essentials: Applications and
standards, first edition, Pearson Education, Asia, 2001.

Presented by: Wudneh T. Application of Laplace Transform for Cryptography 33 / 33