Tripartite Key Agreement Protocol using Triple Decomposition Search Problem
T.Isaiyarasi. International Journal on Cryptography and Information Security (IJCIS), 2 (3):
49-56(September 2012)
DOI: 10.5121/ijcis.2012.2304
Abstract
A Key Agreement Protocol is a tool by which two parties can share a common key for their subsequent communication .Many cryptographic protocols are based on the hardness of Integer Factorization and Discrete Logarithm Problem. Very few Protocols are based on search problems in non – abelian groups. In this paper we present a Tripartite Key Agreement Protocol Using Triple Decomposition Search Problem using which three parties may agree on a common shared key in two rounds. We have chosen Discrete Heisenberg group and three cyclic sub groups as our platform to apply the above protocol.
%0 Journal Article
%1 tisaiyarasitripartite
%A T.Isaiyarasi,
%D 2012
%E Shawon, S.M.Rahman
%J International Journal on Cryptography and Information Security (IJCIS)
%K Problems Search
%N 3
%P 49-56
%R 10.5121/ijcis.2012.2304
%T Tripartite Key Agreement Protocol using Triple Decomposition Search Problem
%U https://wireilla.com/papers/ijcis/V2N3/2312ijcis04.pdf
%V 2
%X A Key Agreement Protocol is a tool by which two parties can share a common key for their subsequent communication .Many cryptographic protocols are based on the hardness of Integer Factorization and Discrete Logarithm Problem. Very few Protocols are based on search problems in non – abelian groups. In this paper we present a Tripartite Key Agreement Protocol Using Triple Decomposition Search Problem using which three parties may agree on a common shared key in two rounds. We have chosen Discrete Heisenberg group and three cyclic sub groups as our platform to apply the above protocol.
@article{tisaiyarasitripartite,
abstract = {A Key Agreement Protocol is a tool by which two parties can share a common key for their subsequent communication .Many cryptographic protocols are based on the hardness of Integer Factorization and Discrete Logarithm Problem. Very few Protocols are based on search problems in non – abelian groups. In this paper we present a Tripartite Key Agreement Protocol Using Triple Decomposition Search Problem using which three parties may agree on a common shared key in two rounds. We have chosen Discrete Heisenberg group and three cyclic sub groups as our platform to apply the above protocol.
},
added-at = {2019-11-14T11:02:17.000+0100},
author = {T.Isaiyarasi},
biburl = {https://www.bibsonomy.org/bibtex/290c28d9616a8f99d181ce6c5fdeb3c33/alinta},
doi = {10.5121/ijcis.2012.2304},
editor = {Shawon, S.M.Rahman},
interhash = {6d6e184ca77ef7f61d8a2143262ad60e},
intrahash = {90c28d9616a8f99d181ce6c5fdeb3c33},
issn = {1839-8626},
journal = {International Journal on Cryptography and Information Security (IJCIS)},
keywords = {Problems Search},
language = {English},
month = sep,
number = 3,
pages = {49-56},
timestamp = {2019-11-14T11:02:17.000+0100},
title = {Tripartite Key Agreement Protocol using Triple Decomposition Search Problem},
url = {https://wireilla.com/papers/ijcis/V2N3/2312ijcis04.pdf},
volume = 2,
year = 2012
}