An XTR-Based Constant Round Key Agreement Scheme

Table 1

Comparison between XTR-GDH, XTR-CR, and other competitive key agreements schemes.

Protocol	Number of exponentiations	Number of pairings	Number of scalar multiplications	Number of hash	Message amount	Round of communications
GDH.3 [1]	2𝑛−3	—	—	—	2𝑛−1	𝑛+1
TGDH [3]	𝑛(log2𝑛+1)	—	—	—	𝑛	log2𝑛
Dutta05 [4]	𝑛log3𝑛	—	—	—	𝑛	log3𝑛
TYO07 [7]	2𝑛^2+5𝑛	—	—	𝑛^2+𝑛+1	5𝑛^2+6𝑛+1	4
FXW09 [8]	7𝑛		—	2𝑛	2𝑛^2+6𝑛	4
ZZLC09 [13]	5𝑛	—	—	3𝑛	4𝑛^2	4
YWJ08 [14]	—	2𝑛^2+4𝑛	𝑛^2+5𝑛	—	5𝑛^2	3
NPKW07 [5]	5.5𝑛+5𝑛log2𝑛−1	—	—	—	7𝑛+10𝑛log2𝑛−4	3
Daniel07 [6]	𝑛−2	—	—	—	3𝑛	3
XTR-GDH	—	—	16𝑛log2𝑝	1	2𝑛−1	3
FWM08 [15]	—	—	2𝑛^3−2𝑛^2+𝑛	2𝑛	2𝑛^3−𝑛^2	2
LL10 [11]	—	5𝑛	10𝑛	—	3𝑛^2	2
Xiong13 [24]	𝑛	𝑛	5𝑛	—	<2n	2
XTR-CR	—	—	(𝑛 − 1)(88log2𝑝+128)	—	𝑛	2