Abstract
This paper describes several speedups and simplifications for
XTR. The most important results are new XTR double and single
exponentiation methods where the latter requires a cheap
precomputation. Both methods are on average more than 60\% faster
than the old methods, thus more than doubling the speed of the already
fast XTR signature applications. An additional advantage of the
new double exponentiation method is that it no longer requires
matrices, thereby making XTR easier to
implement. Another XTR single exponentiation method is presented that
does not require precomputation and that is on average more than
35\% faster than the old method. Existing applications of similar
methods to LUC and elliptic curve cryptosystems are reviewed.
Translated title of the contribution | Speeding up XTR |
---|---|
Original language | English |
Title of host publication | Advances in Cryptology - ASIACRYPT 2001 |
Publisher | Springer Berlin Heidelberg |
Pages | 125 - 143 |
Number of pages | 18 |
Volume | 2248 |
ISBN (Print) | 3540429875 |
Publication status | Published - Dec 2001 |
Bibliographical note
Conference Proceedings/Title of Journal: Advances in Cryptology - ASIACRYPT 2001, 7th International Conferenceon the Theory and Application of Cryptology and Information Security,
Gold Coast, Australia, December 9-13, 2001, Proceedings