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

net/publication/314670821

Extended Bellman Ford Algorithm with Optimized Time of Computation

Chapter in Advances in Intelligent Systems and Computing · February 2016

DOI: 10.1007/978-981-10-0135-2_23

CITATIONS READS

3 717

2 authors:

Neha Agarwal Akhil Kaushik

Dwarkadas J. Sanghvi College of Engineering The Technological Institute of Textile and Sciences
2 PUBLICATIONS 5 CITATIONS 22 PUBLICATIONS 96 CITATIONS

SEE PROFILE SEE PROFILE

All content following this page was uploaded by Akhil Kaushik on 14 June 2019.

The user has requested enhancement of the downloaded file.

 Special Issue: Proceedings of 2nd International Conference on Emerging Trends in Engineering and Management, ICETEM 2013

Extended Diffie-Hellman Algorithm for Key Exchange and

Management

Akhil Kaushik Satvika

Assistant Professor, C.S.E Department Assistant Professor, I.T Department
T.I.T&S College T.I.T&S College
Bhiwani, Haryana, India Bhiwani, Haryana, India
Email: [email protected] Email: [email protected]

Abstract— Since the publication of Diffie-Hellman algorithm for security strategy that has evolved over decades, especially after
two-party key exchange in 1976, the concept of key exchange over the growth of computers.
the insecure communication channel has revolutionized totally.
The purpose of algorithm is used to enable users to security Cryptography is broadly described as the art and science of
exchange a key that can be used for subsequent encryption. The
scrambling data to prevent unauthorized access over unsecure
ability to dynamically and publicly establish a session key for
secure communication between groups of participants is a channel transmission. Encryption is basically classified into
foundation of many secure group applications, such as conference three categories namely symmetric key cryptography,
calls, distributed computation, and distributed databases. The asymmetric encoding and hash function. Secret key or
very idea is based on using arithmetic calculations to transmit the symmetric key cryptography was the first one to develop. It
shared session keys using a cost-effective and easy mechanism. uses a single secret or private key for encrypting data on
The Diffie-Hellman algorithm provides better security against sender’s end and decrypting data at receiver’s end. The
attacks like man-in-the-middle attacks. Due to such superior decryption process is exactly opposite to the encryption
features Diffie-Hellman algorithm has been revised many times by process; and is usually faster than other forms of cryptography.
several authors. Our proposed algorithm is also based on Diffie-
However, one major problem associated with it is the key
Hellman algorithm, which uses a new technique for sharing
session keys. The proposed “Extended Diffie-Hellman Algorithm” distribution problem i.e. distributing key to the receiving party
uses a digital image to produce random numbers for exchanging over internet. This is a major setback because if key is detected
keys over insecure network. by the eavesdropper, then the ciphertext can be discovered
easily[3].
Keywords— Diffie-Hellman Algorithm(DHA), True Random
Numbers(TRNs), Key exchange, Extended Diffie-Hellman This key distribution problem is symmetric encryption was
Algorithm(XDHA). addressed by the research project undertaken by Whitfield Diffie
(research scholar) and Martin Hellman (professor) of M.I.T
University, U.S.A in 1976. The algorithm developed by them
I. INTRODUCTION is popularly known as “Diffie-Hellman” algorithm, that is used
for securely exchanging a shared secret between two parties, in
The world today has been transfigured into a global real-time, over an un-trusted networks[8]. A shared secret is
marketplace where e-commerce and ERP has made the important between two parties who may not have ever
corporate world to start thinking from scratch again. There have communicated previously, so that they can encrypt their
so many benefits that industries reap from latest technologies. communications. It is basically a key agreement protocol that
But these technology advancements also require more safety maintains secrecy between two parties for key exchange. Key
measures to protect the mission-critical data from the agreement is a method in which the device communicating in
unauthorized persons like eavesdropper. Nonetheless, the chief the network establishes a shared secret between them without
transfer medium of significant information is the Internet and exchanging any secret data. In this method the devices that need
as widely accepted it is the most unsafe way, where bad guys to establish shared secret between them exchange their public
are also present with the good guys. Hence, it is very vital to keys. Both the devices on receiving the other device’s public
figure out what are the loopholes in the security measures and key perform key generation operation using its private key to
what countermeasures can be taken in advance to prevent data obtain the shared secret[4]. Due to its superior security
loss or manipulation. Diverse countermeasures that are attribute, it is widely used and has changed a lot with pace of
employed in the present era are cryptography, steganography, time. Several researchers have modified DHA and used it over
firewalls, access lists, proxy application gateways, security many security protocols like Secure Socket Layer(SSL),
protocols like SSL, TLS, etc[1]. Cryptography is the stand-out Internet Protocol Security(IPSec), etc.

67
International Journal of Advances in Engineering Sciences Vol. 3 (3), July 2013 e-ISSN: 2231-0347 Print-ISSN: 2231-2013
 Special Issue: Proceedings of 2nd International Conference on Emerging Trends in Engineering and Management, ICETEM 2013

There are chiefly two types of solutions that are proposed for
key exchange problem. The first solution is based on the idea
where one participant generates keying material and then
distributes that information securely to other parties. This key
generator party is usually a trusted party that controls key
generation and distributes the keys. The receiving parties
assumed that the keying material provided is secure and
valid[9]. The second solution is based on the concept where
each participant generates two keys: a public and a private key.
Some secure key exchange operations are utilized for
dispensing the public keys over insecure channel. Figure 1: Diffie- Hellman Algorithm

Apparently the second solution is the more popular approach. The Diffie-Hellman algorithm states that it is computationally
The key exchange operations are the central idea of key infeasible to determine the value of K by just observing the
distribution algorithms; and they determine the efficiency and conversation and knowing the public keys.
performance of the key-exchange algorithms[7]. The next
section describes the most eminent key-exchange algorithm i.e.
the Diffie-Hellman algorithm. III. PROPOSED KEY EXCHANGE ALGORITHM
The core idea that makes Diffie-Hellman algorithm so robust
and secure is that idea of random numbers. Random numbers
II. DIFFIE-HELLMAN ALGORITHM are associated with cryptography since its beginning and play
The Diffie-Hellman algorithm was the first public key algorithm an important role in use of encryption for various network
that was published first in 1976. It was the collaborative effort security applications[6]. They are especially great when it
of Whitfield Diffie and Martin Hellman to establish a first comes to the defence against replay attacks. Random sequences
practical method to share secret over an unprotected channel. are classified into two divisions: true random numbers and
However, it is also believed that this method was first invented pseudo random numbers. Pseudo random sequences can be
by Malcolm Williamson of U.K; however he did not publish generated from deterministic sources ANSI X9.17, FIPS 186
it[10]. generator etc. True random numbers are generated from
hardware, software and De-skewing methods[5]. True random
Nevertheless the Diffie-Hellman algorithm solves the major numbers are more secure than Pseudo random numbers but it
predicament of symmetric key encryption i.e. share the secret requires extra devices which is problematic for common users.
key among communication parties, even when every bit of
information is being observed by the adversary[2]. The process In this paper, a new public key cryptosystem is proposed
of Diffie-Hellman algorithm is described as follow: namely “Extended Diffie-Hellman Algorithm for Key
i. Both parties A and B agree upon two constants p and g. Exchange”. This proposed algorithm is different from the
Where p is a prime number and g is the generator less Diffie-Hellman Algorithm in two ways:
than p. i. It suggests a new method to generate true random
ii. Both A and B choose their private keys a and b numbers based on images, which is quite convenient,
respectively such that they are random numbers and less simple and cost-effective.
than p. ii. It recommends a new technique for calculation of
iii. Let ga mod p and gb mod p be the public keys of A and B shared secret key.
respectively. A. Random Number Generation using Image
iv. Then A and B exchange their public keys over unsecure The complexity of Diffie-Hellman Algorithm can be increased
medium like internet. if the True Random Numbers(TRNs) are employed in the
v. Then party A computes (gb mod p)a mod p that is equal encryption process. The small images may be used to generate
TRNs, which may lead to better security as compared to pseudo
to gba mod p.
random numbers[7]. Another important feature is time
vi. Also party B computes (ga mod p)b mod p that is equal to consumption to generate output. The TRNs derived from
gab mod p. images can be fast, easy and no requirement of additional
devices. The pixel value of the image can be obtained with the
vii. The shared secret key K is computed as K = gba mod p =
help of simple functions from programming languages like Java
gab mod p. and it is converted into string value. To convert the image into
binary format, the Red-Green-Blue(RGB) value of the content
can be derived for every pixel. The TRNs generation is
discussed as follow:

68
International Journal of Advances in Engineering Sciences Vol. 3 (3), July 2013 e-ISSN: 2231-0347 Print-ISSN: 2231-2013
 Special Issue: Proceedings of 2nd International Conference on Emerging Trends in Engineering and Management, ICETEM 2013

i. Choose an image (or generate it using MS paint or Public key, YA = g XA mod p

other picture manager software).
Secret Key, K1 = YBXA mod p
ii. Take the RGB content of pixels and convert the image
ii. Keys used by party B are as follows:
to binary format.
Private Key, XB = a + b + c
iii. Put the binary numbers in a tabular format(rows and
columns). Public key, YB = g XB mod p
iv. ‘p’ value can be generated by concatenating rows of Secret Key, K1 = YAXB mod p
the table. iii. The values of ‘p’ and ‘g’ are derived from the image
v. ‘g’ value can be produced by concatenating columns as described above. Values of ‘a’, ‘b’ and ‘c’ are
of the table. selected randomly from same image such that their
vi. Hence, the only need to transmit is the image and the values lie between 0 and p-1.
receiver can apply the same to retrieve the values.
Since it is difficult for the intruder to work-out all possible values
for a set of equations to choose the correct one, it is absolutely
difficult task to choose the desired one. This makes the proposed
algorithm robust against eavesdroppers.

IV. SECURITY ANALYSIS

The “Extended Diffie-Hellman Algorithm” proposed in the
paper is in superior to the original Diffie-Hellman Algorithm in
respect to defence against unauthorized attacks. Variables used
in the mathematical calculations for proposed algorithm are
extracted from the diminutive images; hence it adds an
additional fortification phase in the algorithm.

The main drawbacks of Diffie-Hellman Algorithm are discrete

Figure 2: Sample Image for TRNG logarithm and Man-in-the-Middle attack. This downside occurs
because p and g values are shared publicly[6]. This made the
encryption process susceptible to break by the eavesdropper or
middle man. Mani-in-the middle attack means that a middle
man watching the conversation jumps in between and poses as
receiving side to the sender; and as sender to the receiving side.
Thus, he is not breaking the key but making his own pair of
keys and pretending as a legitimate user. But sharing the values
of p and g by sending over a small image can make it hard to
crack. Moreover, the second step of encryption i.e. using
different mathematical equations adds an extra shield of
protection of data. For areas with low bandwidth or very less
memory storage, this method proves an immense success for
cryptographic applications.

V. PERFORMANCE ANALYSIS
Performance is one criterion which makes XDHA the solution
of the problem that corporate personnel are looking for. The
algorithm not only enhances the safety of data to a larger extent;
Figure 3: Sample of binary output generated from the image
but also does that with ease and speed. One major reason for
performance enhancement is the use of small images for
B. Modification to Diffie-Hellman Procedure
generation of true random numbers and sending them over
The second step involved in Extended Diffie Hellman
insecure channel instead of values of p and g. This step lets the
Algorithm is the mathematical calculations to generate the
communicating parties exchange data without the need of
values of encryption keys which need to share over unsafe
supplementary hardware device. Overall, it is a simple and
medium. The modified algorithm procedure of XDHA is
cost-effective approach.
discussed as below:
i. Keys used by party A are as follows:
Private Key, XA = a * b *c

69
International Journal of Advances in Engineering Sciences Vol. 3 (3), July 2013 e-ISSN: 2231-0347 Print-ISSN: 2231-2013
 Special Issue: Proceedings of 2nd International Conference on Emerging Trends in Engineering and Management, ICETEM 2013

Another performance evaluation criterion is the execution [5] J. Gutierrez & A. Winterhof, “Exponential sums of nonlinear
speed of the proposed algorithm. The following tables show the Congruential pseudorandom number generators with Rédei
execution times measured for DHA and XDHA: functions”, Finite Fields and Their Applications 14 (2008) 410–416,
Sciencedirect, 2007.
p g XA XB Time(seconds) [6] J. Hoffstein, J. Pipher & J.H. Silverman, “An Introduction to
7 5 3 7 2621961879.71 Mathematical Cryptography”, Springer Publications, 1st edn, 2010.
53 23 3 5 2621961594.36 [7] M. Bellare, D. Pointcheval & P. Rogaway, “Authenticated Key
13 11 7 11 2621961965.37 exchange secure against dictionary attacks”, IN Proc. Of Eurocrypt,
pp. 139-155, 2010.
41 31 9 11 2621962202.52
[8] RFC 2631, Diffie-Hellman Key Agreement Method, June 1999,
Table 1: Execution Times for Diffie-Hellman Algorithm
Available at http://tools.ietf.org/html/rfc2631
p g a b c Time(seconds) [9] S. B. Wilson & A. Menezes, “Entity authentication and
529 37 6 7 18 2622122788.81 authenticated transport protocols employing asymmetric techniques”,
SPRINGER 1997.
449 61 2 17 16 2622123638.75
[10] Y. Amir, Y.Kim & C. Nita-Rotaru, “ Secure communication using
289 61 2 5 16 2622123756.61 contributory key agreement”, IEEE Transactions on Parallel and
377 29 4 6 13 2622123859.78 Distributed systems, pp. 468-480, 2009.
Table 2: Execution Times for Extended Diffie-Hellman Algorithm

Experiments reveal that the execution time of the proposed key-

exchange algorithm is nearly the same to the Diffie-Hellman
algorithm; and with additional security. Thus the performance
of XDHA is superior to DHA and other applications based on
the same concept.

VII. CONCLUSION AND FUTURE WORK

In this research article, a new method for key exchange issue
has been designed based on the Diffie-Hellman algorithm. The
Extended Diffie-Hellman Algorithm has been designed with
the help of true random numbers generated from miniature
images. The eavesdropper or middle-man could not derive the
shared key from the image. The intended algorithm also did not
make use of extra devices for random number generation. Small
change in the image should lead to a significant difference in
the generated random number. Moreover, the suggested
algorithm defines a method to generate private keys using
equations that is defined by user. Experimental results show
that the XDHA can work effectively by generating correct
factors and it is almost impossible to be crack by intruder.

The prospect work of XDHA includes usage of lossless

compression techniques to protect image during transmission.
Furthermore, more complex equations may be employed to
boost the defense level and make it immune to the intruders or
eavesdroppers.

REFERENCES
[1] A. J. Menezes, P. C. V. Oorschot, & S. A. Vanstone, “Handbook
of Applied Cryptography”, 5th edn., CRC Press Inc., USA, 2001.
[2] B. A. Forouzan, “Cryptography and Network Security”, Special
Indian Edition, The McGraw- Hill companies, New Delhi, 2007.
[3] C. Bissell & A.K. Vladimir, “Pioneer of the sampling theorem,
cryptography, optimal detection, planetary mapping”. [History of
Communications], IEEE Communications Magazine, Vol. 47, No.10,
pp. 24 - 32, Oct 2009.
[4] D. Wallner, E. Harder, & R. Agee, “Key management for
multicast: Issues and architectures”, Internet Draft (Work in progress),
July 1998.

70
International Journal of Advances in Engineering Sciences Vol. 3 (3), July 2013 e-ISSN: 2231-0347 Print-ISSN: 2231-2013

View publication stats