You are on page 1of 11

PSG COLLEGE OF TECHNOLOGY

Department of Biomedical Engineering

APPLICATION OF LAPLACE
TRANSFORM IN CRYPTOGRAPHY
TO:
The Department of Mathematics, PSG College of Technology

19D201- COMPLEX VARIABLES


AND TRANSFORMS

BY:
222D201 - ABHISHEK D

22D202 - ABIRAMI S S

22D203 - AKSHAYA T

22D204 - ALEENA MARIAN SATHYAM

22D205 - ARTHI V

22D206 - ARYA T
ACKNOWLEDGEMENTS:

We would like to offer our deepest gratitude to Assistant Professor, Dr. Bagyalakshmi Morachan, for giving us
this wonderful opportunity to work on this research and for also igniting the spark within us to go beyond our
limits. We would like to express a special thanks to Dr. R. Vidhyapriya, Professor and Head of Biomedical
Engineering Department, and our Tutor, Ms. Sree Padmini, for being our biggest supporter and motivator. Lastly,
we would also like to thank our fellow classmates for helping us get back on our feet when faced with a lot of
setbacks.
Contents

1. ABSTRACT:.......................................................................................................................................................................................... 1
2. INTRODUCTION:............................................................................................................................................................................... 1
3. LITERATURE REVIEW:................................................................................................................................................................... 1
4. DEFINITION:....................................................................................................................................................................................... 2
4.1 Definition 1:.................................................................................................................................................................................... 2
4.2 Definition 2:.................................................................................................................................................................................... 2
4.3 Definition 3:.................................................................................................................................................................................... 2
4.4 Definition 4:.................................................................................................................................................................................... 2
5. ENCRYPTION:..................................................................................................................................................................................... 2
6. DECRYPTION:..................................................................................................................................................................................... 3
7. APPLICATION OF LAPLACE TRANSFORM:............................................................................................................................. 4
7.1 Data Encryption:........................................................................................................................................................................... 4
7.2 Controlled Communication:..................................................................................................................................................... 4
7.3 Secure Storage:............................................................................................................................................................................. 4
7.4 Password Protection:................................................................................................................................................................. 4
8. CONCLUSION:..................................................................................................................................................................................... 4
9. REFERENCES:..................................................................................................................................................................................... 5
APPLICATION OF LAPLACE TRANSFORM IN CRYPTOGRAPHY

1. ABSTRACT:
Laplace transform is being widely used in control system engineering, to study a signal in frequency
domain, in the analysis of electrical circuits, etc. In this report, we discuss its recent application in the field of
cryptography. This involves an iterative method, where we apply successive Laplace transform on suitable
functions for encrypting the plain text. Similarly, corresponding inverse Laplace transform is applied to the
encrypted plain text i.e., cipher text for decryption. Finally, these results are obtained in the generalized form.
We also develop the corresponding encryption algorithm for this method and discuss about the
implementation strategies of this method.

2. INTRODUCTION:
In Today's world, with a drastic increase in the usage of computer networks and internet, the protection
of sensitive information from unauthorized access has been a critical issue. As a result, one of the most widely
used approaches for securing information is Cryptography. Cryptography, is basically the science of using
complicated mathematical principles to encrypt and decrypt data. The primary goal of cryptography is to store
information or transmit it across insecure networks (like the Internet) so that it cannot be read by anyone
except the intended recipient. Therefore, it ensures the confidentiality and integrity of both data in transit as
well as data at rest.

3. LITERATURE REVIEW:

 Hiwarekar, A. in the year 2015 published a paper on ‘Application of Laplace Transform for Crtptography'.
Punef:fInternational Journal of Engineering and Science Research.

Algorithm may prevent different attacks on the symmetric encryption such as cipher text only, known plaintext,
chosen plaintext, chosen cipher text, chosen text. Moreover, we can divide the document into blocks of four to
six alphabets. Applying encryption on these blocks can generate cipher text as well as the keys respectively. For
each block, chose different value so that even if the attacker cracks one of the blocks, he will not be able to
access other blocks. We can also apply iterative method in some cases. This will resist all types of attacks
mentioned earlier. The other aspect of algorithm is the key length which is considered as an advantage in some
applications and as a disadvantage in case of data length limited applications.

 E. Adeyefa, L. A in the year 2021 published a paper on 'Application of Laplace Transform to Cryptography
using Linear Combination of Functions'.
Ado ekiti : TWMS Journal of Applied Mathematics

In this proposed work, we improve an innovative cryptographic scheme using Laplace transforms of linear
combination of functions and the key is the number of multiples of mod 26. The function provides numerous
transformations as per the requirements which are the most functional factor for changing key. The similar
results can be obtained by using the Laplace transform of some suitable functions. Hence, extension of this
work is possible. The sequence in which the message (the cipher text and key) is sent to the receiver is very
important. If any of these sequences is altered, the information which the receiver will get after decoding will
be completely wrong.

 CH. Jayanthi, V. Srinivas in the year 2019 published a paper on ‘Mathematical Modelling for Cryptography
using Laplace Transform’
1
In the present paper a new cryptographic scheme is proposed using Laplace transform. The Laplace transform
is used for encrypting the plain text and corresponding inverse Laplace transform is used for decryption. The
Laplace transform is a generally used integral transform in mathematics, physics and electrical engineering that
transforms a function of time into a function of complex frequency. The inverse Laplace transform takes a
complex frequency domain function and gives a function defined in the time domain. Proposed algorithm
serves as many transformations as per the requirements which are useful for changing key. Hence it is very
difficult for an eyedropper to trace the key by any attack. The application has been done in MATLAB and
artificial neural network. The expectation in such a problem clears and create forms of security which can
prevent the hackers from attacking the information.

 A.P. Hiwarekar in the year 2013 published a paper on ‘Application of Laplace Transform for Cryptographic
Scheme’
London : Proceedings of the World Congress on Engineering

In the proposed work we develop a new cryptographic scheme using Laplace transforms of hyperbolic
functions and the key is the number of multiples of mod n. Therefore, it is very difficult for an eyedropper to
trace the key by any attack. In a two- party communication between entities A and B, sound cryptographic
practice dictates that the key can be kept changing frequently for each communication session.

4. DEFINITION:

4.1 Definition 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.

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

4.3 Definition 3:
Encryption transforms a plain text message into cipher text, whereas decryption transforms a cipher text
message back into plain text. 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.

4.4 Definition 4:
If f (t) is a function defined for all positive values of t, then the Laplace Transform of f (t) is defined as

L [ f ( t ) ] =∫ ⅇ
−st
f ( t ) ⅆt
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].

5. ENCRYPTION:
We consider standard expansion

r 3 t3 r 5 t 5 r 7 t 7 r 2 i+1 t 2 i+ 1
sinhrt=rt+ + + +…+ +…
3! 5! 7! 2 i+1 !

2
∞ 2 i+1
(rt )
¿∑
i=0 2 i+1 !

Where r ∈ N is a constant,
∞ 2 i+1
23 t 5 25 t 7 27 t 9 22 i+ 1 t 2i +3 (2 t)
t 2 sinh 2 t=t 2 + + + + …+ =∑
3! 5! 7! 2i+1 ! i=0 2 i+1!

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

Let given message called plain text be ‘FLOWER’, it is equivalent to 5 11 14 22 4 17.

Let us assume that G0,0=5, G0,1=11, G0,2=14, G0,3=22, G0,4=4, G0,5=17.

Writing these numbers as a coefficient of t2sinh2t, and assuming f(t)=Gt2sinh2t we get,

[ ]G 22 i t 2 i+2
3 5 5 7 7 9 9 11 11 13 ∞ 3 3 5 5 7 7 9
2 t 2 t 2 t 2t 2 t 2t 2 t 2t 2t
f ( t )=t 2 G0,0 +G1,0 +G2,0 +G 3,0 +G4,0 +G5,0 =∑ i ,0 =5 +11 +14 +22
3! 5! 7! 9! 11 ! i=0 2i+1 ! 1! 3! 5! 7!

Taking Laplace transform on both sides of, we have

60 1760 18816 202752 225280 5431296


L {f (t)} =L{Gt2sinh2t} = 4
+ 6 + 8 + 10
+ 12
+ 14
s s s s s s

Adding p=5 to the resultant values 60 1760 18816 202752 225280 5431296 and then adjusting to mod 26
that is

65 = 13 mod 26,

1765 = 23 mod 26,

18821 = 23 mod 26,

202757 = 9 mod 26,

225285 = 21 mod 26,

5431301 = 5 mod 26

Sender sends the values 2 67 723 7798 8664 208896 as a key. Assuming

G0,1=13, G1,1=23, G2,1=23, G3,1=9, G4,1=21, G5,1=5.

The given plain text gets converted to cipher text

13 23 23 9 21 5.

Here message ‘FLOWER’ gets converted into ‘NXXJVF’.

6. DECRYPTION:
For the decryption of the received cipher text, we proceed exactly in the reverse direction using inverse
Laplace Transform.

The method is as follows.

3
Suppose we have received message as ‘NXXJVF’ which is equivalent to 13 23 23 9 21 5.

Let us assume that

G0,1=13, G1,1=23, G2,1=23, G3,1=9, G4,1=21, G5,1=5.

Using given key ki,0 i=0,1,2, 3...L as 2 67 723 7798 8664 208896 and p=5, assuming q i,1=Gi,1+26ki,1-p, i=0,1,2,3,
L…

We consider

−d 2 2 60 + 1760 + 18816 + 202752 + 5431296


G( ¿
ds ¿ ¿ = s4 s6 s8 s10 s14

Taking inverse Laplace Transform we get


3 3 5 5 7 7 9 9 11 11 13
2 2t 2 t 2 t 2 t 2t 2 t
f ( t )=G t sinh 2 t=5 +11 + 14 +22 +4 +17
1! 3! 5! 7! 9! 11 !

[
¿ t 2 G0,0 + G1,0
23 t 5
3!
+ G2,0
25 t 7
5!
+ G3,0
27 t 9
7!
+G4,0
29 t 11
9!
+G5,0
211 t 13
11! ]
Here we have G0,0=5, G0,1=11, G0,2=14, G0,3=22, G0,4=4, G0,5=17.

Here message 5 11 14 22 4 17 is equivalent to ‘FLOWER’. Thus ‘NXXJVF’ under inverse Laplace Transform
gets converted to ‘FLOWER’.

7. APPLICATION OF LAPLACE TRANSFORM:

7.1 Data Encryption:


Encryption is a fundamental cryptographic technique used to protect sensitive data at rest. It converts plaintext
information into an unintelligible form (ciphertext) using encryption algorithms and keys. Only authorized
parties with the corresponding decryption keys can decrypt the data and access the original information. Disk
encryption, file encryption, and database encryption are examples of data encryption applications.

7.2 Controlled Communication:


Cryptography is widely used to ensure the confidentiality and integrity of communication channels. It protects
sensitive information during transmission, preventing unauthorized access and tampering. Secure protocols
like SSL/TLS used in HTTPS, SSH, and VPNs rely on cryptography to establish secure connections.

7.3 Secure Storage:


Cryptography is used to secure the process of updating software and firmware. Digital signatures are employed
to verify the integrity and authenticity of updates, ensuring that the code has not been tampered with during
transit and that it originates from a trusted source. This prevents malicious actors from injecting harmful or
unauthorized code.

7.4 Password Protection:


Cryptography is essential for storing passwords securely. Instead of storing actual passwords, systems store
cryptographic hash values of passwords. Hash functions generate fixed-length irreversible representations of
passwords, making it difficult to derive the original password from the hash value.

4
8. CONCLUSION:
The application of Laplace transform in cryptography offers several advantages and benefits. The Laplace
transform is a powerful mathematical tool used to analyze and solve complex equations and systems of
differential equations. While it may not be directly applied to encryption algorithms or cryptographic protocols,
it can be employed in various aspects of cryptography to enhance security and efficiency. Laplace transform
offers valuable insights into the behaviour of cryptographic algorithms, it is just one tool among many used in
cryptography. Its application should be combined with other cryptographic techniques, such as encryption
algorithms, key management, and authentication protocols, to ensure comprehensive security. Overall, the
application of Laplace transform in cryptography enhances the understanding, analysis, and design of
cryptographic algorithms, leading to improved security, efficiency, and resilience against attacks. Its utilization
alongside other cryptographic techniques contributes to the development of robust and reliable cryptographic
systems, strengthening the protection of sensitive information in various domains

5
9. REFERENCES:
[1] Stanovich A. Introduction to cryptography 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] A.P. Hiwarekar / International Journal of Engineering & Science Research

You might also like