TY - GEN
T1 - Key improvements to XTR
AU - Lenstra, A.K.
AU - Verheul, E.R.
PY - 2000
Y1 - 2000
N2 - This paper describes improved methods for XTR key representation and parameter generation (cf. [4]). If the field characteristic is properly chosen, the size of the XTR public key for signature applications can be reduced by a factor of three at the cost of a small one time computation for the recipient of the key. Furthermore, the parameter set-up for an XTR system can be simplified because the trace of a proper subgroup generator can, with very high probability, be computed directly, thus avoiding the probabilistic approach from [4]. These non-trivial extensions further enhance the practical potential of XTR.
AB - This paper describes improved methods for XTR key representation and parameter generation (cf. [4]). If the field characteristic is properly chosen, the size of the XTR public key for signature applications can be reduced by a factor of three at the cost of a small one time computation for the recipient of the key. Furthermore, the parameter set-up for an XTR system can be simplified because the trace of a proper subgroup generator can, with very high probability, be computed directly, thus avoiding the probabilistic approach from [4]. These non-trivial extensions further enhance the practical potential of XTR.
U2 - 10.1007/3-540-44448-3_17
DO - 10.1007/3-540-44448-3_17
M3 - Conference contribution
SN - 3-540-41404-5
T3 - Lecture Notes in Computer Science
SP - 220
EP - 233
BT - Advances in Cryptology - ASIACRYPT 2000 (Proceedings 6th International Conference on the Theory and Application of Cryptology and Information Security, Kyoto, Japan, December 3-7, 2000)
A2 - Okamoto, T.
PB - Springer
CY - Berlin
ER -