Finite field for scientists and engineers
Finite field for scientists and engineers
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Guide to Elliptic Curve Cryptography
Guide to Elliptic Curve Cryptography
Public-key cryptosystems based on cubic finite field extensions
IEEE Transactions on Information Theory
Hi-index | 0.00 |
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.