International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & ISSN

0976 - 6375(Online), Volume 4, Issue 6, November - December (2013), IAEME

TECHNOLOGY (IJCET)

ISSN 0976 6367(Print) ISSN 0976 6375(Online) Volume 4, Issue 6, November - December (2013), pp. 09-15 IAEME: www.iaeme.com/ijcet.asp Journal Impact Factor (2013): 6.1302 (Calculated by GISI) www.jifactor.com

IJCET
IAEME

MULTIPARTY KEY AGREEMENT PROTOCOL USING TRIPLE DECOMPOSITION PROBLEM IN DISCRETE HEISENBERG GROUP

T.ISAIYARASI Research Scholar, Bharathiar University &Assistant Professor Department of Mathematics, Valliammai Engineering College Tamil Nadu -603203, India Dr.K.SANKARASUBRAMANIAN Research Supervisor, Bharathiar University & Professor, Department of Mathematics,Sri Sairam Engineering College. Tamilnadu-600048, India

ABSTRACT
A Key Agreement Protocol (KAP) or mechanism is a key establishment technique in which a shared key is derived by two (or more) parties as a function of information contributed by, or associated with each of these such that no party can predetermine resulting value. This paper presents a New Multiparty Key Agreement Protocol using the Triple Decomposition Search Problem .To implement this; the Discrete Heisenberg group is chosen as the platform group. The protocol depends on the hardness of Triple Decomposition Search problem in the Discrete Heisenberg group.

Keyword: Discrete Heisenberg group, Key Agreement Protocol, Triple Decomposition Search
problem.

1.

INTRODUCTION

A protocol is a multiparty algorithm, defined by a sequence of steps precisely specifying the actions required of two or more parties in order to achieve a specified objective. Key establishment is a process or protocol whereby a shared secret becomes available to two or more parties, for subsequent cryptographic use. Key establishment may be broadly subdivided into key transport and key agreement.

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 4, Issue 6, November - December (2013), IAEME

A key transport protocol or mechanism is a key establishment technique where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s). A key agreement protocol or mechanism is a key establishment technique in which a shared secret is derived by two (or more) parties as a function of information contributed by ,or associated with ,each of these (ideally) such that no party can predetermine the resuming value. This paper proposes a New Multiparty Key Agreement Protocol using Triple Decomposition Search problem. In order to implement the Triple Decomposition Search Problem, the Discrete Heisenberg group is chosen as the platform group. K parties agree on a common key in K- 1 rounds. The paper is organised in the following manner. In section 2 introduces the discrete Heisenberg group. Section 3 deals with the Triple Decomposition Problem. The Multiparty Key Agreement Protocol using Triple Decomposition Problem is implemented in Section 4 . Section 5 discusses the security of the protocol some of the encryption schemes are presented in Section 6 and Section 7 concludes the paper.

2.

INTRODUCTION TO DISCRETE HEISENBERG GROUP

3 Z p

The Discrete Heisenberg group may be described as the set endowed with the following multiplication, where p is a prime , , , , , ,

of all integer triples

2.1. Some Computational Facts about .

The following computational facts about can be easily derived from the definition of Multiplication above. Let , , , , , , be any integers. Then the multiplication in satisfies the following equations: (a) , , , , b) , , , , , , , , (c) , , , , , , 0, 0 (d) In particular, 0, 1, 0, 0, 0, 1 1, 0, 0. (e) (i), 0, 0 0, , , , (ii)0, , 0 0, 0, , , (iii)0, 0, 0, , 0 0, , (f) (i)(1, 0, 0)n = (n, 0, 0) mod p (ii)0, 1, 0 0, , 0 (iii)0, 0, 1 0, 0,

2.1.1. Proposition.

2.1.2. Centre Z []:

, Centre of coincides with 0 0 where [H, H] = Z [H].

2.1.3. Generators of :

Formulae (d)-(f) show that (0, 1, 0) and (0, 0, 1) generate . Specifically, , , 0, 1, 0, 0, 0, 1 0, 0, 1 0, 1, 0 , , , . for the next result, we use the non-standard notation to stand for , for any integer.

10

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 4, Issue 6, November - December (2013), IAEME

2.2. Proposition.
For any , , and any , we have , , , , .

2.3. Proposition.
may be presented as , : , , 1 , , ,with (resp., ) corresponding to the generator 0, 1, 0 (resp.,0, 0, 1). The following results have been already established:

2.3.1. Result 1:
Let L be any group, and let and be any elements of L satisfying the two relations given above. Then, there is a unique homomorphism such that 0, 1, 0 0, 0, 1

2.3.2. Result 2:
Let and be any elements of . There exists a unique endomorphism h of such that 0, 1, 0 0, 0, 1 .

3.

THE TRIPLE DECOMPOSITION PROBLEM

In order to describe the system in a more general setting we assume the underlying structure is a non-commutative group.

3.1. Definition: A non commutative group G is an algebraic structure with a binary operation and
whose elements satisfy the following axioms. (i)For , in , . is in ( Closure property) (ii)For , , in . . . . (Associative property) (iii)There exists an element in such that for all in, . . (iv) For all in there exists an element in G such that . . (v) In general . . (non commutativity)

3.2. Definition:
For an element g G let / . is called the centralizer of g in G. For a subset , , of G, define , to be the set of elements in G that commute with all for 1 ,2 , . (Hence

3.3. The Protocol: The protocol goes as follows:

Alice picks two elements , , chooses sets which are subsets of centralizers of respectively. Alice publishes Bob picks two elements , , chooses sets which are subsets of centralizers of respectively. Bob publishes Alice chooses random elements , , . , , is her private key. She sends Bob her public key , , where , , Bob chooses random elements , and sets , , as his private key He sends Alice his public key , , where , , Alice computes
11

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 4, Issue 6, November - December (2013), IAEME

Bob computes 1 2 3 1 1 2 2 3 3 is their shared secret key The security of the system depends on solving the equations 1 2 3 to get the private key of Alice. Solving equation (2), i.e., decomposing as three elements , is known as the triple decomposition problem. In order to apply the triple decomposition, the platform group must satisfy the following properties: P1) The group should be a non commutative group of exponential growth. P2) It should be computationally easy to perform group operations (multiplication and inversion) P3) It should be computationally easy to generate pairs , , 1 P4) For a generic set . . of elements of the group it should be difficult to compute . . P5) Even if . . and 2 . . . . are computed it should be hard to find and and where H is some fixed subgroup given by its generating set such that for any .

4.

Implementation of Triple Decomposition Problem in Discrete Heisenberg Group:

K parties , agree on the following: A finite non abelian group (Discrete Heisenberg group =Zp3) where p is a prime number sufficiently large Cyclic subgroups , , of such that , , , , , and , , . iii) , 1 ,2 1 ,2 . , , 1 ,2 1 ,2 , , 1 ,2 1 ,2

The following actions are carried out to arrive at a common shared key:
I Round: chooses , , , and computes , , chooses , , , and computes , , chooses , , , , and computes , , chooses , , , , and computes , , chooses , , , , and computes , , sends ( , , to
12

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 4, Issue 6, November - December (2013), IAEME

sends ( , , ) to sends ( , , ) to A4 sends ( , , ) to sends ( , , ) to

II Round:
computes , , and sends ( , , ) to computes , , and , , ) to computes , , and sends , , ) to

computes , , and sends ( , , ) to

(K-1)st Round:
computes computes computes computes computes is their common shared key

5.

SECURITY ANALYSIS OF THE PROTOCOL

An adversary looking fors public key in first round needs to solve the following; Let , , , , , , , , , . , , , , , , . . 1 If he wants to solve a1 or x1, he has to solve the system of equations in (1) Similarly he has to solve another set of equations of the same type as in (1) to recover or from . Let , , , , , , , , , , , = , , . , , . , , = , , He has to solve the following system of equations, Solving for is known as triple decomposition problem. Similar procedure must be done if he wants to solve for the other entities private and public keys. If the adversary looking for A1s public key in the second round, he has to solve more complicated equations.

13

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 4, Issue 6, November - December (2013), IAEME

6.

ENCRYPTION SCHEME

The K entities , , may use their common key for encrypting and decrypting the messages.

6.1. Scheme 1: Encryption:

If suppose wants to send a message m to any of the other entities, he computes And sends E.

Decryption:
Since the other entities know the value of K they decrypt as follows,

6.2. Encryption Scheme 2:

Apart from having the common key, they may agree on an endomorphism they may use the twisted contumacy search problem for encryption and decryption. : and

Encryption: Decryption:

Computes and sends it to others. Others have the value of K, they decrypt

Encryption Scheme 3:
Encrypts the message m by finding and sends to other entities. Since they have the key K, they decrypt

7.

CONCLUSION

This paper proposes a Multi party Key Agreement protocol using the triple decomposition search problem which is implemented in Discrete Heisenberg group. K parties may arrive at a common shared key in K-1 rounds. This protocol depends on the difficulty of solving triple decomposition search problem in Discrete Heisenberg group. Solving the triple decomposition search problem in the first round itself is a tedious process as discussed in Section 5. It is much more difficult for an adversary to break the system in the second round and so for the remaining rounds, since at each round the public keys of the communicating parties become more complicated to solve. Hence the protocol presented in this paper provides a secure communication over any number of parties. In continuation to this work, this protocol may be made secure against the man in middle attack by providing authentication by means of digital signature.

REFERENCES
[1] A.Joux, A One Round Protocol for tripartite Diffe-Hellman,In W.Bosma ,editor proceedings of Algorithmic Number Theory ,Symposium ,ANTS IV ,volume 1838 of Lecture Notes in Computer Science ,Pages 385 -394 Springer Verlag,2000 Alexei Myansnikov,Vladmir Shpilarain ,Alexander Ushakov, Group Based Cryptography, 2000 Mathematical Subject Classification: 11T71, 20Exx, 20Fxx, 20Hxx, 20P05, 60B15,68P25, 94A60, Atul Chaturvedi, Varun Shukla,Tripartite Key Agreement Protocol using Conjugacy Problem in Braid Groups. International Journal of Computer Applications (0975 8887) Volume 31 No.1, October 2011
14

[2]

[3]

International Journal of Computer Engineering and Technology (IJCET), ISSN 0976-6367(Print), ISSN 0976 - 6375(Online), Volume 4, Issue 6, November - December (2013), IAEME

[4] [5]

[6] [7] [8] [9] [10]

[11]

[12] [13] [14] [15]

[16]

[17]

[18]

Chun-Li Lin, Hung-Min Sun, Michael Steiner and Tzonelih Hwang Three-party Encrypted Key Exchange WithoutServer Public-Keys Giuseppe Ateniese, Michael Steiner, and Gene Tsudik, Member, IEEEg-Min Sun, Michael Steiner and Tzonelih Hwang -New Multiparty Authentication Services and Key Agreement Protocol Ho Kyu, Hyang Sook Lee, Young Ran Lee - Multiparty Authenticated Key Agreement Protocols From Multilinear Forms. Ko et al Public Key Cryptosystem based on Braid Groups , Crypto 2000 LNCS 1880, pp66183 Peter J.Khan, Automorpisms of the Discrete Heisenberg Group, arXiv:math / 0405109VI [math SG]6, May 2004 Rene Peralta,Eiji Okamoto,School of information science Some combinatorial problems of importance to Cryptography T.Isaiyarasi, Dr.K.Sankarasubramanian , A New Multiparty Key Agreement Protocol Using Search Problems in Discrete Heisenberg Group ,Indian Journal Of Computer Science and Engineering, Volume 3 ,Issue 1 ,Page No.159- 168.EISSn 0976 5166 ,Print ISSN : 2231 3850 Vladmir Shplrain and Alexander Ushakov, A new Key Exchange Protocol based on the decomposition problem .2000 Mathematics Subject classification classification 94A60,20F05,20F06,68P5 Vladmir Shplrain and Gabrial Zapata, Using the subgroup membership search problem in public key cryptography, www.sci.ccny.cuny.edu/~shpil/crypmemb.pdf Yesem Kurt, A new key exchange primitive based on the triple decomposition problem eprint.iacr.org/cryptodb/data/paper.pp? Zhaohui Cheng, Luminita Vasiu and Richard Comley proposed Pairing- Based One Round Tripartite Key Agreement Protocol. Samir Elouaham, Rachid Latif, Boujemaa Nassiri, Azzedine Dliou, Mostafa Laaboubi And Fadel Maoulainine, Analysis Electrocardiogram Signal Using Ensemble Empirical Mode Decomposition And Time-Frequency Techniques, International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 2, 2013, pp. 275 - 289, ISSN Print: 0976 6367, ISSN Online: 0976 6375, Published by IAEME. Aarti Bairagi and Shweta Yadav, A New Parameter Proposed For Route Selection In Routing Protocol For Manet, International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 1, 2013, pp. 31 - 37, ISSN Print: 0976 6367, ISSN Online: 0976 6375, Published by IAEME Wategaonkar D.N and Deshpande V.S., On Improvement Of Performance For Transport Protocol Using Sectoring Scheme In WSN, International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 4, 2013, pp. 275 - 281, ISSN Print: 0976 6367, ISSN Online: 0976 6375, Published by IAEME Saloni Singla And Tripatjot Singh Panag., Evaluating The Performance Of Manet Routing Protocols, International Journal of Computer Engineering & Technology (IJCET), Volume 4, Issue 1, 2013, pp. 125 - 130, ISSN Print: 0976 6367, ISSN Online: 0976 6375, Published by IAEME

15