DocumentCode
676162
Title
A New Key Exchange Protocol on Thompson Groups
Author
Hongxin Ma ; Yingjue Fang ; Xiaofeng Wang
Author_Institution
Dept. of Math. & Comput. Sci., Shenzhen Univ., Shenzhen, China
fYear
2013
fDate
16-18 Dec. 2013
Firstpage
1
Lastpage
4
Abstract
By analyzing a key agreement protocol based on conjugacy and discrete logarithm problems proposed by Sakalauskas et al., we find that this protocol is vulnerable to linear attack. Then, an improved protocol on Thompson groups is proposed. The security of the new protocol is guaranteed by the uniqueness of inverse elements of a group, hiding property of hash function, discrete logarithm problem, and conjugacy search problem.
Keywords
cryptographic protocols; group theory; search problems; Thompson groups; conjugacy search problem; discrete logarithm problems; hash function; hiding property; inverse elements; key agreement protocol; key exchange protocol; Cryptography; Educational institutions; Finite element analysis; Generators; Protocols; Search problems;
fLanguage
English
Publisher
ieee
Conference_Titel
IT Convergence and Security (ICITCS), 2013 International Conference on
Conference_Location
Macao
Type
conf
DOI
10.1109/ICITCS.2013.6717780
Filename
6717780
Link To Document