See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/301585534

New Mathematical Modeling For Cryptography

Article · May 2014

CITATIONS READS
9 5,211

1 author:

Anil Hiwarekar
Vidya Pratishthan’s Kamalnayan Bajaj Institute of Engineering and Technology, Baramati (S.P.University of Pune), India.
22 PUBLICATIONS   85 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

BETTER NETWORK SECURITY USING GENERALISED HILL CIPHER ALGORITHAM View project

All content following this page was uploaded by Anil Hiwarekar on 23 April 2016.

The user has requested enhancement of the downloaded file.

Journal of Information Assurance and Security.
ISSN 1554-1010 Volume 9 (2014) pp. 027-033
© MIR Labs, www.mirlabs.net/jias/index.html

New Mathematical Modeling For Cryptography

A.P. Hiwarekar
Vidya Pratishthan’s College of Engineering,
Vidyanagari, Bhigwan Road,Baramati,
(University of Pune)
Dist.Pune, Maharashtra, India, Pin-413133
[email protected]

Abstract : Information protection has been an important computer and information security is obvious. To be
part of human life from ancient time. In computer society, secured, information needs to be protected from
information security becomes more and more important unauthorized access. Hence, data security has become a
for humanity and new emerging technologies are critical and imperative issue. One of the widely used
developing in an endless stream. Cryptography is one of approaches for information security is Cryptography.
the most important techniques used for securing Cryptography, the mathematic of encryption, plays a
transmission of messages and protection of data. vital role in many fields.
Examples includes, e-commerce; electronic The fundamental objective of cryptography is to
communications such as mobile communications, enable two people, to communicate over an insecure
sending private emails; business transactions; Pay-TV; channel in such a way that an opponent cannot
transmitting financial information; security of ATM understand what is being said. Encryption is the process
cards; computer passwords etc, which touches on many of obscuring information to make it unreadable without
aspects of our daily lives. Cryptography provides privacy special knowledge. A cipher is an algorithm for
and security for the secret information by hiding it. It is performing encryption (and the reverse, decryption) a
done through mathematical technique. series of well-defined steps that can be followed as a
Laplace transform has many applications in procedure. The original information is known as plain
various fields here we discuss its new application to text, and the encrypted form as cipher text. The cipher
cryptography. This paper presents a new iterative method text message contains all the information of the plaintext
for cryptography, in which we apply successive Laplace message, but is not in a format readable by a human or
transform of suitable function for encrypting the plain computer without the proper mechanism to decrypt it.
text and apply corresponding inverse Laplace transform Ciphers are usually parameterized by a piece of auxiliary
for decryption. Generalization of the results is also information, called a key. The encrypting procedure is
obtained. varied depending on the key which changes the detailed
Encryption by Laplace Transform is resistance operation of the algorithm. Without the key, the cipher
to nearly all types of attacks on symmetric encryption cannot be used to encrypt, or more importantly, to
algorithms. There is flexibility in implementation of decrypt, [1, 2, 3, 5, 6, 7, 10, 11, 12]. Various techniques
algorithms. One can implement the algorithms as per the for cryptography are found in literature [1], [2], [3], [5],
application demands. We can find many application of [12], [17], [18]. Mathematical technique using matrices
encryption by Laplace Transform in banking, Security, for the same are found in Dhanorkar and Hiwarekar, [4];
One time password generation. Overbey,Traves and Wojdylo, [14]; Saeednia, [16]. In
Naga Lakshmi, Ravi Kumar and Chandra Sekhar, [7];
Key words: Cryptography, Data encryption, Applications to Hiwarekar, [10] and [11]; Vyavahare, Bani Upmanayu;
coding theory and cryptography, Algebraic coding theory; [21]; Sujitha, [19]; they encrypt a string by using series
cryptography, Laplace Transforms.
expansion of f(t) and its Laplace transform and the
results for cryptanalysis found in Gupta and Mishra [9].
1. Introduction DNA secret writing using Laplace transform is found in
In Today's world, with increasing usage of computer Sukalyan and Moumita [20].
networks and internet, the importance of network,

MIR Labs, USA

28 Hiwarekar

2. Definitions and Standard Results L{sinh kt} 

k
,
Definition 2.1.: Plain text signifies a message that can be 1. s2  k 2 (2.4)
understood by the sender, the recipient and also by k
anyone else who gets an access to that message. L1{ 2 }  sinh kt.
s  k2
Definition 2.2.: When plain text message is codified
using any suitable scheme, the resulting message is
called as cipher text.
Definition 2.3.: Encryption transforms a plain text 2. L{t n }  n ! , L1{
n!
}  tn, n  N. (2.5)
n 1
message into cipher text, whereas decryption transforms s s n 1
a cipher text message back into plain text. Every
encryption and decryption process has two aspects: The
d 
n

 t }  
algorithm and the key. The key is used for encryption
and decryption that makes the process of cryptography L{t n f  F s,
3.  ds  (2.6)
secure. Here we require following results.
 d 
n

L1{  F  s }  t n f t  ,
2.1. The Laplace Transform: If f (t ) is a function  ds 
defined for all positive values of t , then the Laplace [6, 8, 13, 15].
Transform of f (t ) is defined as
 3. Main Results
L{ f (t )}  F ( s )   e  st f (t )dt , (2.1)
0
3.1 Encryption

provided that the integral exists. Here the parameter s is We consider standard expansion
a real or complex number. The corresponding inverse
1
Laplace transform is L {F ( s)}  f (t ), [6, 8, 13, 15].

(3.1)
2.2. Theorem: Laplace transform is a linear transform.
That is, if

L{ f1 (t )}  F1 ( s), L{ f 2 (t )}  F2 ( s), L{ f n (t )}  Fn (s), (2.2)

then

L{c1 f1 (t )  c2 f 2 (t )  cn f n (t )} where r  N is a constant, and

(2.3)
 c1F1  s   c2 F2  s    cn Fn  s  ,
t 2 sinh 2t
where c1 , c2 , , cn are constants, [6, 8, 13, 15]. 23 t 5 25 t 7 27 t 9
 2t 3    
3! 5! 7!
(3.2)
2.3. Some Standard Results of Laplace Transform: 2 2 i 1 t 2 i  3
 2 i 1!
 
In this paper we are assuming that all the 
2 2 i 1 t 2 i  3
considered functions are such that their Laplace
transform exists. We are also assuming that N be the
 
i 0
2 i 1!
.
set of natural numbers. Here we consider following We allocated 0 to A and 1 to B then Z will be 25.
standard results of Laplace transform
Let given message called plaintext be ‘COMPUTER’, it
is equivalent to
New Mathematical Modeling For Cryptography 29

2 14 12 15 20 19 4 17. Sender sends the values

0 86 620 5316 43323
Let us assume that 233472 264664 5827662
as a key. Assuming
G0,0  2, G1,0  14, G2,0 = 12, G3,0 = 15, G4,0 = 20, G 0,1 = 24, G1,1 = 4, G2,1 = 8, G3,1 = 24,

G5,0 = 19, G6,0 = 4, G7,0 =17, Gn,0 = 0 for n  8. G4,1 = 2 G5,1 = 0, G6,1 = 16, G7,1 = 20,
Writing these numbers as a coefficients of Gn ,1 = 0 for n  8.
t 2 sinh 2t , and assuming f (t )  Gt sinh 2t , we get
2

The given plain text gets converted to cipher text

23 t 3 25 t 5
f (t )  t 2 [G0,0 2t  G1,0  G2,0
3! 5! 24 4 8 24 2 0 16 20.
7 7 9 9
2 t 2 t 211 t 11 Here message ‘COMPUTER’ gets converted to
 G3,0  G4,0  G5,0 ‘YEIYCAQU’.
7! 9! 11!
13 13 15 15 These results are included in the following
2 t 2 t
 G6,0  G7,0 ]
13! 15! Theorem 3.1: The given plain text in terms of
 2 2 i 1 t 2 i  3G (3.3) Gi ,0 , i  1, 2, 3, , under Laplace transform of
 2 i 1!
i ,0

i 0
Gt 2 sinh 2t , (that is by writing them as a
coefficients of t 2 sinh 2t , and then taking the Laplace
2t 3 23 t 5 25 t 7 27 t 9
2  14  12  15 transform) can be converted to cipher text
1! 3! 5! 7!
9 11 11 13 13 15 Gi ,1  22i 1  2i  2  2i  3 Gi ,0 mod 26 (3.5)
2 t 2 t 2 t
 20  19 4  qi ,1  26ki ,1 , for i  0,1, 2, 3, ,
9! 11! 13!
15 17
2 t
 17 . where,
15! qi ,1  22i 1  2i  2 2i  3 Gi ,0 , i  0,1, 2,3, , (3.6)
Taking Laplace transform on both sides we have
and a key
L{ f (t )}  L{Gt 2 sinh 2t}
qi ,1  Gi ,1
24 2240 16128 138240 ki ,1  for i  0,1, 2,3, . (3.7)
 4 + 6 + + 26
s s s8 s10 (3.4) Now we apply the same operation again on the output of
1126400 6070272 6881280
+   the resulting cipher text obtained in the Theorem 3.1 and
s12 s14 s16 obtain its new form which is included in the following
151519232 theorem.
 . Theorem 3.2: The given plain text in terms of
s18
under Laplace transform of
Adjusting the resultant values Gi ,1 t 2 sinh 2t, (that is by writing them as a coefficients
24 2240 16128 138240 1126400
6070272 6881280 151519232 of t 2 sinh 2t, and then taking the Laplace transform)
to mod 26 that is can be converted to cipher text
Gi ,2  Gi ,1 22 i 1  2i  2   2i  3  mod 26 (3.8)
24  24 mod 26, 2240  4 mod 26,  qi ,2  26ki ,2 , i  0,1, 2, 3, ,
16128  8 mod 26, 138240  24 mod 26,
1126400  2 mod 26, 6070272  0 mod 26, where,
6881280  16 mod 26, 151519232  20 mod 26. qi ,2  Gi ,1 22i 1  2i  2 2i  3 , i  0,1, 2,3, , (3.9)

and a key
30 Hiwarekar

qi ,2  Gi ,2 coefficients of t l sinh rt , and then taking the

ki ,2  , i  0,1, 2, 3, , . (3.10)
26 Laplace transform) can be converted to cipher text
Gi ,1  Gi.0 r 2i 1  2i  2  2i  3
Now we apply such operations successively j times on
the given plain text and obtain its new form as cipher text.  2i  l  1 mod 26 (4.3)
This iterative method is included in the following  qi ,1  26ki ,1 , i, l  0,1, 2, 3, ,
theorem.
Theorem 3.3: The given plain text in terms of
Gi ,0 , i  1, 2, 3, , under Laplace transform of
with qi ,1 and ki ,1 are given by (4.1) and (4.2)
Gi ,0 t 2 sinh 2t , successively j times (that is by writing
respectively.
them as a coefficients of t 2 sinh 2t , and then Remark 4.1: Theorem 3.3 is a special case of theorem 4.1
taking the Laplace transform successively) can be with l  2, r  2.
converted to cipher text
Now we apply above operations successively j times on
Gi , j  Gi , j 1 22i 1  2i  2  2i  3 mod 26 the output obtained in the last step on the cipher text and
(3.11)
 qi , j  26ki , j , i, j  0,1, 2, 3, , obtain new cipher text this is included in the following
new theorem.
where Theorem 4.2: The given plain text in terms of
qi , j  Gi , j 1 22i 1  2i  2  2i  3 , Gi ,0 , i  1, 2, 3, , under Laplace transform of
(3.12)
i, j  0,1, 2, 3, , Gi ,0 t l sinh rt , successively j times (that is by writing
l
them as a coefficients of t sinh rt , and then taking the
and a key Laplace transform successively) can be converted to
qi , j  Gi , j cipher text
ki , j  , i, j  0,1, 2, 3, ,. (3.13)
26 Gi , j  Gi , j 1 r 2i 1  2i  2  2i  3

Remark 3.1: Theorem 3.1 is a special case of Theorem

 2i  l  1 mod 26 (4.4)

3.3 with j  1 and Theorem 3.2 with j  2 .  qi , j  26ki , j , i, j , l  0,1, 2, 3, ,

and
4. Generalization qi , j  Gi , j 1r 2i 1  2i  2  2i  3
(4.5)
The generalization of the results in section 3 can be  2i  l  1 , i, j, l  0,1, 2, 3, ,
obtained by considering more general function given by
f (t )  Gt l sinh rt , r , l  N . Using the procedure and key
discussed in section 3, we can convert the given message qi , j  Gi , j
Gi ,0 to Gi ,1 , ki , j  , i, j  0,1, 2,3, ,. (4.6)
26
where
qi ,1  Gi ,0 r 2i 1  2i  2  2i  3  2i  l  1 , Remark 4.1: Theorem 4.1 is a special case of Theorem
(4.1)
i, l  0,1, 2, , 4.2 with j  1. Hence all Theorems 3.1 to 4.1 follows
with key from Theorem 4.2.
qi ,1  Gi ,1
ki ,1  , i  0,1, 2, 3, . (4.2) 5. Decryption
26 For the decryption of the received cipher text we proceed
exactly in the reverse direction using inverse Laplace
Hence we have following generalized theorem transform. The method is as follows.
Theorem 4.1: The given plain text in terms of Suppose we have received message as ‘YEIYCAQU’
Gi ,0 , i  1, 2, 3, , under Laplace transform of which is equivalent to
Gi ,0 t l sinh rt , (that is by writing them as a 24 4 8 24 2 0 16 20.
Let us assume that
New Mathematical Modeling For Cryptography 31

Assuming Hence we have following

G 0,1 = 24, G1,1 = 4, G2,1 = 8, Theorem 5.1: The given cipher text in terms of
G3,1 = 24, G4,1 = 2 G5,1 = 0, Gi ,1 , i  1, 2,3, , with a given key
G6,1 = 16, G7,1 = 20, Gn,1 = 0 for n  8. ki ,0 , i  0,1, 2,3, can be converted to plain text Gi ,0
Using given key ki ,0 , i  0,1, 2,3, as under the inverse Laplace transform of
2
 d  2 n qi ,0
0 86 620
43323 233472 264664
5316
5827662
G 
 ds 
 
 s  2  i 0 s 2i  4
2 2
, (5.4)

and assuming
qi ,1  Gi ,1  26ki ,1 , i  0,1, 2,3, .. (5.1) where
26ki ,0  Gi ,1
Gi ,0  , i  0,1, 2,3, , (5.5)
We consider
2
2 2 i 1
 2i  2  2i  3
 d  2
G 
 ds   s 2  22  and
24 2240 16128 138240 qi ,0  26ki ,0  Gi ,1 , i  0,1, 2,3, . (5.6)
 + 6 + +
s4 s s8 s10 (5.2)
1126400 6070272 6881280 The generalized iterative theorem can be obtained on the
+   similar way which is included in the following
s12 s14 s16
Theorem 5.2: The given cipher text in terms of
151519232
 . Gi , j , i, j  1, 2, 3 , with a given key
s18
n q ki , j 1 , i, j  1, 2,3 , can be converted to plain text
  2ii ,1 4 .
i 0 s
Gi , j 1 under the inverse Laplace transform of
Taking inverse Laplace transform we get  d 
2
2 n q
G    i2,ij41 , (5.7)
f (t )  Gt 2 sinh 2t  ds   s  2  i 0 s
2 2

2t 3 23 t 5 25 t 7
2  14  12
1! 3! 5! where
2 t7 9 9 11
2 t 211 t 13 26ki , j 1  Gi , j
 15  20  19 Gi , j 1  , i, j  1, 2, 3, , (5.8)
7! 9! 11! (5.3) 2 2 i 1
 2i  2  2i  3
13 15 15 17
2 t 2 t
4  17 and
13! 15!
qi , j  26ki , j  Gi , j , i, j  1, 2, 3, , (5.9)
23 t 3 25 t 5
 t 2 [G0,0 .2t  G1,0  G2,0 Remark 5.1: The most generalized decryption theorem
3! 5!
corresponding to Theorem 4.2 can be obtained on the
27 t 7 29 t 9 211 t 11
 G3,0  G4,0  G5,0 similar way.
7! 9! 11! Remark 5.2: Results in [7], G.Naga Lakshmi, B. Ravi
213 t 13 215 t 15 Kumar and A. Chandra Sekhar are obtained by
 G6,0  G7,0 ]. t
13! 15! considering Laplace transform te and are generalized in
Here we have [10, 11], Hiwarekar. Results in [4], Dhanorkar and
G0,0  2, G1,0  14, G2,0 = 12, Hiwarekar are obtained by using generalized Hill cipher
algorithms.
G3,0 = 15, G4,0 = 20, G5,0 = 19, 4.1. Illustrative Examples
G6,0 = 4, G7,0 =17, Gn,0 = 0 for n  8. Using results obtained in Theorem 4.2, if we have
original message ‘COMPUTER’, then it gets converted
to
Here message 2 14 12 15 20 19 4 17 is 1. ‘YMSYGAWG’ for r  2, j  3, l  2,
equivalent to ‘COMPUTER’. 2. ‘COOCUAEW’ for r  2, j  6, l  2,
32 Hiwarekar

3. ‘KOIQWAGU’ for r  3, j  3, l  3, attack. The results in section 4 provide as many

4. ‘QMMKAAEA’ for r  5, j  3, l  4, transformations as per the requirements which is the
most useful factor for changing key.
5. ‘GOMGAAMA’ for r  5, j  4, l  4. 4. The similar results can be obtained by using
Laplace transform of a suitable function. Hence
6. Implementation Strategies extension of this work is possible.
The main advantage of this algorithm is for same input 5. The entire document can be encrypted by
alphabets we can get different output alphabets. We just considering block ciphers of small sizes.
need to change vale of ‘r’ or ‘j’ or both values (in 6. For computer network security random number
theorem 4.2). Algorithm may prevent different attacks on generation is a prime important task and also it is very
the symmetric encryption such as ciphertext only, known essential in constructing keys for cryptographic
plaintext, chosen plaintext, chosen ciphertext, chosen algorithm. Method used in this paper can be useful for
text. We can divide the document into blocks of random number generation.
four alphabets. Apply Encryption on these blocks in 7. To reduce the crypt-analysis attack risk, a
dynamic key theory plays important role the method
parallel and generate cipher text as well as the keys
presented in this paper is useful in such situations.
respectively. If we consider encryption of one
complete document then we can choose different Acknowledgements:
values of ‘r’ (in Theorem 4.2) for different blocks. Author is thankful to Principal Dr.S.B.Deosarkar and
We can choose random function as follow: Vidya Pratishthan's College of Engineering, Baramati,
r  rand ()%100 Dist. Pune, Maharashtra, India, for the support to this
For each block chose different value of r so that by any work. Author is also thankful to BCUD University of
way attacker cracked one block he will not be able to Pune, India, for the financial support to this work under
crack other blocks. We can also apply iterative method in research project `Better network security using
some cases. This will resist all types of attacks generalized Hill cipher algorithm'.
mentioned earlier. For Brute Force attack large amount References
of calculations will be needed as attacker doesn’t know [1] Alexander Stanoyevitch, Introduction to
the algorithm as well as we are adding extra layer of cyrptography with mathematical foundations and
security by using variable values of ‘r’ , ‘j’ or ‘l’ or all at computer implementations, CRC Press, (2002).
a time (in Theorem 4.2). Other aspect of algorithm is key [2] Barr T.H., Invitation to Cryptography, Prentice Hall,
length it can be considered as advantage in some (2002).
applications or disadvantage in case of data length [3] Blakley G.R., Twenty years of Cryptography in the
limited applications. open literature, Security and Privacy 1999,
Proceedings of the IEEE Symposium, 9-12, (May
7. Discussion and Concluding Remarks 1999).
[4] Dhanorkar G.A. and Hiwarekar A.P., A generalized
Hill cipher using matrix transformation,
1. For breaking a key of 256 bit by Bruce force
International J. of Math. Sci. & Engg. Appls,Vol.5
attack, when faster super computer are used, it requires
No.IV, 19-23, (July2011).
about 3:31×1056 years, which is almost impossible
[5] Eric C., Ronald K., James W.C., Netwark Security
2. Many sectors such as banking and other
Bible Second edn.,Wiley India pub.(2009).
financial institutions are adopting e-services and
[6] Erwin Kreyszing, Advanced Engineering
improving their Internet services. However, the e-service
Mathematics,John Wiley and Sons Inc.(1999).
requirements are also opening up new opportunity to
[7] G.Naga Lakshmi, B.Ravi Kumar and A.Chandra
commit financial fraud. Internet banking fraud is one of
Sekhar, A cryptographic scheme of Laplace
the most serious electronic crimes and mostly committed
transforms, International Journal of Mathematical
by unauthorized users. The new method of key
Archive-2, 2515-2519, (2011).
generation scheme developed in this paper may be used
[8] Grewal B.S., Higher Engineering Mathematics,
for a fraud prevention mechanism.
Khanna Pub., Delhi, (2005).
3. In the proposed work we develop a new
[9] Gupta P., Mishra P. R., Cryptanalysis of “A New
cryptographic scheme using Laplace transforms and the
Method of Cryptography Using Laplace Transform,
key is the number of multiples of mod n. Therefore it is
Proceedings of the Third International Conference
very difficult for an eyedropper to trace the key by any
 New Mathematical Modeling For Cryptography 33

on Soft Computing for Problem Solving Advances Vidya Pratishthan’s College of Engineering Baramati
in Intelligent Systems and Computing Vol.258, from March 2001. Anil also has to his credit sixteen
2014, 539-546. publications out of which four research papers are
[10] Hiwarekar A.P., A new method of cryptography published in the International Journals and four in
using Laplace transform, International Journal of National Journals. He has presented eleven papers in
Mathematical Archive, 3(3), 1193-1197, (2012). International and National Conferences. He has attended
[11] Hiwarekar A.P., A new method of cryptography around twenty one workshops/ conferences/ Seminars
using Laplace transform of hyperbolic functions, and also attended seven summer /refresher courses. He
International Journal of Mathematical has an important role in organizing about twelve
Archive, 4(2), 208-213, (2013). conferences/ workshops / programs. He was a chairman
[12] Johannes A. Buchmann, Introduction to of one session of AMTI National Conference (Dec.2011)
Cryptography,Fourth Edn.,Indian Reprint , at Baramati. He is working on BCUD Research project
Springer, (2009). ‘Better Network Security Using Generalized Hill Cipher
[13] Lokenath Debnath, Dambaru Bhatta, Integrl Algorithm'. Sanctioned by University of Pune,
Transforms and Their Applications, Chapman and Maharashtra, India.
Hall/CRC,First Indian edn.(2010). He is a life member of ISTE, Marathwada Mathematical
[14] Overbey J., Traves W.and Wojdylo J., On the Society, Aurangabad and All India Mathematics
Keyspace of the Hill Cipher, Cryptologia, 29, 59- Teachers of India. He is also member of international
72, (January 2005). association of Engineers.
[15] Ramana B.V., Higher Engineering Mathematics,
Tata McGraw-Hills, (2007).
[16] Saeednia S., How to Make the Hill Cipher Secure,
Cryptologia, 24, 353-360, (October 2000).
[17] Stallings W., Cryptography and network security,
4th edition, Prentice Hall, (2005).
[18] Stallings W., Network security essentials:
Applications and standards, first edition, Pearson
Education, Asia, (2001).
[19] Sujitha S., Applications of Laplace Transforms in
Cryptography, International Journal of Mathematical
Archive, 4(3), 2013, 67-71.
[20] Sukalyan S., Moumita S., DNA Secret Writing
With Laplace Transform, International Journal of
Computer Applications, Vol. 50 – No.5, July 2012,
44-50.
[21] Vyavahare S., Bani Upmanayu, A, Cryptographic
Scheme using Infinite Series and Laplace
transform, Global Research Analysis,Vol.2, No.6
June 2013, 60-61.

Anil P Hiwarekar obtained

M.Sc., M.Phil. (Mathematics) and
has extended his M.Phil. work for
his Ph.D. on ‘Elliptic and
Parabolic boundary value
problems with applications’. He
has been awarded Ph.D. degree in
2008 from Dr.B.A.M.University,
Aurangabad, Maharashtra, India.
Anil has twenty five years
teaching experience at
undergraduate and postgraduate level. He is working in

View publication stats