Speeding up XTR

M. Stam, A.K. Lenstra

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

764 Citations (Scopus)
1 Downloads (Pure)


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.
Original languageEnglish
Title of host publicationAdvances in cryptology - asiacrypt 2001 : proceedings 7th international conference on the theory and application of cryptology and information security, Gold Coast, Australia, December 9-13, 2001
EditorsC. Boyd
Place of PublicationBerlin
ISBN (Print)3-540-42987-5
Publication statusPublished - 2001

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Speeding up XTR'. Together they form a unique fingerprint.

Cite this