On the Computational Efficiency of XTR+

  • Authors:
  • Ningbo Mu;Yupu Hu;Leyou Zhang

  • Affiliations:
  • The Ministry of Education Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an, China 710071;The Ministry of Education Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an, China 710071;The Ministry of Education Key Laboratory of Computer Networks and Information Security, Xidian University, Xi'an, China 710071 and Department of mathematical science, Xidian University, Xi'an, Chi ...

  • Venue:
  • Information Security and Cryptology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

XTR is a famous public key cryptosystem and has been well applied into various scenes. Zehui Wang proposed XTR+, an improved version of XTR, in 2006. In this paper, we modify the fast computation algorithms of XTR for XTR+ and get an algorithm which is about ten times faster than the matrix square-and-multiply algorithm. Although XTR and XTR+ attain the same discrete logarithm security and possess direct computation and transmission advantages, their trace functions based are different. We make a comparison of their performances, and the result shows that XTR+ possesses more complex parameter selection, larger key size and slower computation speed.