121

CHAPTER 5

RESULTS AND DISCUSSION

5.1 INTRODUCTION

In this chapter, the experimental results and their significance are

discussed. The procedure for executing the proposed protocol is discussed in
the following session. The procedure briefly explains the trap-door function
performed by the server, followed by the calculation of the running time for
trap-door function in accordance with the various numbers of bits. The next
session describes the calculation of NA and KAS followed by the running time
calculation of NA and KAS in accordance to the randomly chosen large prime
number. The running time of NA and KAS are also represented using graphical
representation. The next session describes the calculation of NA and the
computing time needed to encrypt NA in accordance to the number of bits
ranging from 128 to 2048. The graphical representation of the same is also
represented. This session is followed by the brief discussion on the output of
the executed proposed protocol.

5.2 EXPERIMENTAL ENVIRONMENT

The performance of the proposed protocol is measured using two

popular heuristics, namely the trapdoor function (TDF) and the pseudorandom
hash function. The trapdoor TDF applies RSA technique for encryption and
 122

decryption. RSA uses two keys namely the public key and the private key.
The public is known to everyone and the private key is kept secret. The
decryption may be performed only if the private key is known. the trapdoor
function is used at the source for encryption and the decryption is done by the
server where only the server knows the secret key.

All the protocols are implemented in C Language environment. In

the protocol execution there are two different client namely user A & user B

party for the communication of user A and user B.

The two communicating users may be physically apart, but

needs to be connected to a common server. If the server is to be used as the
trusted third party. The same procedure needs to be followed even if the
number of communicating parties increases.

The implementation is done in a simple communication

environment, where the two clients are located in the same physical location
and communicate via a common server. The various setups for analyzing the
stability of the proposed protocol is been analyzed and the performance is
measured based on the running time for the computation of N A,KAS and EPW
and also measured based on the computational time of trapdoor function
(TDF).

5.3 PROCEDURE FOR EXECUTING PROPOSED PROTOCOL

Step 1 : Client A selects random number (rA), random exponent (RA),

primes (p and q) and finds the following:
 123

EPWA(NA)
FS(rA)
fKAS(NA)

Step 2 : Client B select random number (rB), random exponent (RB),

primes (p and q) and finds the following:

EPWB(NB)
FS(rB)
fKBS(NB)

Step 3 : The server will decrypt the following

EPWA(NA) and gets NA

FS(rA) and gets rA

EPWB(NB) and gets NB

FS(rB) and gets rB

Step 4 : Authenticating client A and client B.

Step 5 : Server will select a random number(RS) and calculates

NARS ,NBRS ,

fKAS(NARS)

fKBS(NBRS) Then

sends NARS , fKBS(NBRS) and NBRS , fKAS(NARS) to A and

B respectively.
 124

Step 6 : From the obtained hash value client A will authenticate server
and from NBRS lient A will find its key.

Step 7 : From the obtained hash value client B will authenticate server
and from NARS client B will find its key.

The purpose of experimental results is to show the total running

time needed for the heuristic operations involved in various steps of the
proposed protocol. A data set is generated for problem (p) of size ranging
from 128 bits-2048 bits. The operations that measure the efficiency of the
protocol are: TDF, pseudorandom hash function, computing NA, computing
KAS, symmetric encryption.

5.4 RESULT AND DISCUSSION

The three specific steps in the proposed protocol are Trapdoor

function, pseudorandom hash function and symmetric encryption. The
trapdoor function applies RSA symmetric encryption techniques for
encryption and decryption process. Pseudorandom hash function is used for
computing the value NA and the value of KAS.

In addition, symmetric encryption is used for encrypting NA using

KAS, which is to be sent to the server when requesting for authentication. Both
trapdoor function and pseudorandom hash function uses the server secret key
for encryption where, the decryption is done only by the server since, only the
server knows the secret key. The proposed protocol is thus said to be secure.

The following session discusses the results of the computing time

of the trapdoor function, pseudorandom function and symmetric encryption.
 125

5.4.1 Running time for trapdoor function

Initially a random number rA is chosen by the communicating party.

Using trapdoor function rA is to be encrypted. Trapdoor function accepts the
variable size input and produces a fixed size hash value as an output. The
input given to the one-way trapdoor hash function is randomly chosen number
rA .

The value of rA is encrypted using RSA encryption techniques and

the fixed size output obtained is taken as Fs(rA). Based on the number of input
bit taken the computational time of Fs(rA) varies. The variation and the
graphical representation of the same is shown in Figure 5.1.

Table 5.1 represents the computing time required for encrypting the
random numbers ranging from 128 bits to 2048 bits using RSA-Trap door
function.

Table 5.1 Running time for TDF(FS(rA))

Bits Running time in micro

sec

128 1031

256 4742

512 21740

1024 110007

2048 350950
 126

Figure 5.1 Graphical representation of the Running time for TDF(F S(rA))

Table 5.2 represents the computing time required for encrypting the
random numbers ranging from 128 bits to 2048 bits using RSA-Trap door
function with examples.

Table 5.2 Example for TDF

Running
Bits Random number (rA) time in
micro sec
128 340282366901131422834808524128598884352 1031
256 1157920892373161954235709850086879078532699846656009
49958200451847912450686975 4742
512 1340780792994221602675294150306041380359877583447108
6175801850454072995051396875127234117648304748223514
823452990801027315199939961357985136637183508086783
21740
1024 1797693134862315907729305190789024733617976978942306
5351967166675538256081992211537808004666652773924636
8345540921697976343008459198562648787748140473783700
1007583010721341756849568864504549912231177539316083
110007
8340299107490680537655464187877561044547481066944734
9967392350041425897825114263607735702681137709056
 127

Table 5.2 (Continued)

Running
Bits Random number (rA) time in
micro sec
2048 3231700607131100730071487668866995196044410266971548
4032130345427524655138867890893197201411522913463688
7179609218980194941195591504909210950881523864482831
2063087736730099609175019775038965205012988480713543
7508261294619922857058265501512322283816287099628787
8647091415112738669228259962835992893177845095553604
9196007141856049741858482595787977381536496709521811 350950
5910779732512921819609595802271172700950832217906024
2184126269986104746597115725933898242386283050902594
6228568387645624508223465389592957756419092899382989
0387892447791748575841412771494604910624647558643423
830584281562693227069197419997513229803716608

5.4.2 Running time for NA, & KAS

Initially the value of NA is computed using the generated number g,

random exponent RA and large prime number p. The formula for generation
NA is

NA=gRA(mod p)

Once the NA value is calculated it is to be encrypted using the

secrect key shared between the client and server. The symmetric encryption of
NA results in KAS where

KAS=NArA(mod p)

The value of p represent the large prime number and based on the
different prime values the value of KAS changes. The running time for the
 128

computation NA and KAS is shown in tabulation and graphical

representation.

Table 5.3 represents the computing time needed for calculating

NA=gRA(mod p) & KAS=NArA(mod p) for different size of problems(p).

Table 5.3 Running time for calculating NA,KAS

Running time Running

Sl.
Prime (NA) in micro time (KAS)
No.
sec in micro sec
1 4324122104434447665362908248086967822904859 16641 276.3
2 40500691568928903388503314943591776516203 16568 284.6
3 10548813247704246266317485054480132114947 16605 276.5
4 22750475822981512251147389834477659827887 16753 272.6
5 31023376122247516706110077047014990674391 16640 283.7
6 164838881183106336031117884004666831843 16518 214.7
7 29565696133579269116146450939411987039 16592 203.1
8 1756608222940319902160131316475990998066411 16608 274.4
9 116045117879379642828484543996278641093 16527 201.6
10 96834800300461810039999000830418556963 16728 201.4
11 40687382369048479475232114904989637283 16532 216.8
12 247747816765350307022689158418187059 16605 210.1
13 38174514779333277109099448511590627 16487 205.6
14 35305968189548375940583635702770605868345200000000000 32418 33075
00000000000000000000000000000000000000000000229894811
8662442499371103438785908001117297699
15 44232039047331017300449054372069371767548000000000000 43321 32212
00000000000000000000000000000000000000000000288016922
256695919151874017543729714264388803
16 16512117295639007080305234374874315381824254000000000 45102 42317
00000000000000000000000000000000000000000000107518651
7705533946034075336319941046087486299211
17 38143365016287535026992453088120696717455795520835446 22030 55333
9402441808891292308580580746717399
18 28721874389328679940809578569558567881693352764839668 35663 18410
12122474609111598472249014571
19 20000000000000000000000000000000000000000000000000000 59932 47897
00000000000000000000000000000000000000000000000000000
00000000000000000000000000000000000000000000000000000
0000000000000000051447
20 20000000000000000000000000000000000000000000000000000 119460 100990
00000000000000000000000000000000000000000000000000000
00000000000000000000000000000000000000000000000000000
00000000000000000000000000000000000000000000000000000
00000000000000000000000000000000000000000000000000000
00000000000000000000000000000501759
 129

Figure 5.2 Graphical representation of the Running time for NA&KAS

5.4.3 Running time for EPWA(NA)

The value of NA is to be encrypted using the password of the client

under symmetric encryption. Based on the value of N A that is generated the
computational time varies.

Table 5.4 represents the computing time needed to encrypt NA

ranging from 128 bits to 2048 bits with Data encryption standard i.e.
symmetric encryption algorithm.
 130

Table 5.4 Running time for EPWA(NA)

Bits Running time in micro-

sec

64 351.4

128 523.3

256 798.1

512 1347.2

1024 2655.9

2048 4778.5

Figure 5.3 Graphical representation of the Running time for EPWA(NA)

 131

5.5 PERFORMANCE MEASURES

5.5.1 Security

The Three party encrypted key exchange protocol is resistant to

undetectable online password guessing attacks. To overcome the undetectable
online password guessing attacks, In the proposed protocol, Server S encrypts
NBRS and NARS by using rA and rB
NBRS rA and NARS rB to B instead of NARS and NBRS where is a bit-wise
exclusive or operation. Then a malicious attacker B cannot compare if
NARS=NBRS without knowing the random value rA. Because S only knows the
A from Fs(rA). Therefore,
our fixed protocol can resist the undetectable online password guessing
attack.

First, A and B use the trapdoor function FS to hide the random

number rA & rB and pwA & pwB to encrypt NA & NB in step 1. Since only S
knows the trap door, pwA & pwB , only S can authenticate A/B after
receiving the message sent in step 1.

Second, S sends {NBRS, fKAS(IDA, IDB, KAS, NBRS)} to A,{ NARS, f

KBS(IDA, IDB, KBS, NARS} to B in step 2.This message can be used to

Third, A and B derive key from NBRS and NARS respectively, as

mentioned in step 2 in section 4. With the help of fK(IDB, K), fK(IDA, K) A
and B can authenticate with each other.

In the proposed protocol, to prevent the undetectable online

password guessing attacks, it additionally needs only four bit-wise exclusive
or operations ( ).Since the operation is very low cost operation, the
proposed protocol also provides both round and computational efficiency.
 132

5.5.2 Efficiency

Efficiency of secured three party key exchange protocols is

measured in terms of the amount of time it takes to generate the session key,
after the authentication process. The time taken for the one way trapdoor hash
function, pseudorandom hash function and symmetric encryption also
contributes much to the efficiency of the secure protocol. The complexity of
one way trapdoor hash function depends on the time taken for choosing the
random number rA and applying it to the hash function. The Running time for
the calculation of Fs(rA) in the secured three party key exchange protocol is
compare to the running time for the calculation of Fs(rA) in the encrypted key
exchange protocol.

Running time for TDF(FS(rA))

400000

350000

300000 Proposed
Protocol
250000
Series1
Existing
200000
Protocol
Series2

150000

100000

50000

0
0 128 256 384 512 640 768 896 1024 1152 1280 1408 1536 1664 1792 1920 2048 2176
Bits

Figure 5.4 Comparison of Fs(rA)

Secondly, the complexity of pseudorandom hash function depends

on the time taken for the generation of NA and KAS. NA is calculated based on
the chosen random number rA, the generator number g and the large prime
number p. The time taken for calculating NA depends on the time taken for
computation of rA, g and p. Efficiency of the three party encrypted key
 133

exchange protocol is measured by comparing it with the time complexity of

pseudorandom function of the existing protocol.

Figure 5.5 Comparison of NA

300

250

200
Existing Protocol
150
Proposed Protocol
100

50

0
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10
Prime numbers

Figure 5.6 Comparison of KAS

 134

Thirdly,the efficiency of thirty party key exchange protocol is

measured using the complexity of symmetric encryption function. Symmetric
encryption process requires the calculation of NA and calculation of the
session key. Using the session key NA value is encrypted. Efficiency is
measured by comparing the time taken for encryption process in the existing
protocol and three party encrypted key exchange protocol.

Figure 5.7 Comparison of EPWA(NA)

5.5.3 Reduced Transmission Round

The development of an efficient protocol should take the number of

transmission rounds (and steps) and the computation complexity into account.
The performance comparison analyses of the transmission round in the
enhanced protocol and existing protocol. From the view point of the
transmission round, the enhanced protocol adopts the parallel message
transmission mech
 135

Figure 5.8 Transmission round Comparison

The modular exponential operations are reduced since client A

sends EpwA(KAS NA), FS(NA IDA), fKAS(NA) to S and client B sends

EpwB(KBS NB), F S(NB IDB), f KBS(NB) to S. S decrypts EpwA(KAS N A) and

EpwB(KBS N B) and gets KAS NA and KBS NB respectively. Next S extracts
NA and NB from FS(NA IDA), FS(NB IDB) and IDA,IDB. Now, KAS and

KBS NA NA and KBS=KBS NB NB. Since EpwA(KAS NA), FS(NA IDA),

EpwB(KBS NB), F S(NB IDB) are arranged in a proper sequence two modular
exponential operations are reduced on the server side as shown in Figure 5.9,
and hence computation complexity is reduced.
 136

Figure 5.9 Performance Analysis

First client A select random number (rA), random exponent (RA),

primes (p and q), generator number g and client A uses the random
exponent RA, generated number g and the large prime number p for the
calculation of NA, where NA=gRA(mod p) and now encrypts the value of NA
using the password of client A. Secondly using the value of random number
RA and the one way trap door hash function, the hash value of RA is
generated. Thirdly using the value of NA and the session key shared between
the server and client A in pseudo random hash function, the hash value of NA
is generated. These three values are then together converted in to ciphertext
and are send to the server.
 137

First client A select random number (rA), random exponent (RA),

primes (p and q) and finds the following:

1) EPWA(NA)

2) FS(rA)

3) fKAS(NA)

The obtained results (above) will be sent to server.

Figure5.10 Hash, cipher text calculated by Client A

Similarly, Client B generates EPWB(NB), FS(rB), fKBS(NB) and sends

it to the server.
 138

Server receives the cipher text from client A which is to be

decrypted and used for authenticate Client A.

Figure5.11 Cipher text 1 collected by Server

 139

The server will decrypt

EPWA(NA) and gets NA

EPWB(NB) and gets NB

Figure 5.12 Cipher text 2 collected by Server

 140

\The server will decrypt

FS(rA) and gets rA

FS(rB) and gets rB

Figure 5.13 Hash value calculated by Server

 141

From the obtained results fKAS(NA) and fKBS(NB) will be calculated

and verified for authenticating client A .

Figure 5.14 Client A is authenticated by server

 142

After authenticating client A the server now generates the value of

Figure 5.15 Client B is authenticated by server

 143

Figure 5.16 cipher text collected by server from client B

 144

Server will select a random number(RS) and calculates NARS ,NBRS ,

fKAS(NARS) and fKBS(NBRS) and sends NARS, fKBS(NBRS) and NBRS , fKAS(NARS)
to A and B respectively.

Figure 5.17 Selecting Rs by Server

 145

Figure 5.18 NARS calculated by client A

Figure 5.19Calculating key by Client A

 146

Figure5.20 Calculating key by Client B

From the obtained hash value client A will authenticate server and
from NBRS client A will find its key.

Figure 5.21 Key obtained by Client A

 147

From the obtained hash value client B will authenticate server and
from NARS client B will find its key.

Figure 5.22 Key obtained by Client B