Speeding up XTR

M Stam; AK Lenstra

Speeding up XTR

M Stam, AK Lenstra

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

44 Citations (Scopus)

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 Conference
on the Theory and Application of Cryptology and Information Security,
Gold Coast, Australia, December 9-13, 2001, Proceedings

Access to Document

http://www.cs.bris.ac.uk/Publications/pub_info.jsp?id=2000037

Handle.net

Persistent link

Cite this

@inproceedings{702f48c92e4643fa84226475a0c10835,

title = "Speeding up XTR",

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\textbackslash{}\% 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\textbackslash{}\% faster than the old method. Existing applications of similar methods to LUC and elliptic curve cryptosystems are reviewed. ",

author = "M Stam and AK Lenstra",

note = "Conference Proceedings/Title of Journal: Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001, Proceedings",

year = "2001",

month = dec,

language = "English",

isbn = "3540429875",

volume = "2248",

pages = "125 -- 143",

booktitle = "Advances in Cryptology - ASIACRYPT 2001",

publisher = "Springer Berlin Heidelberg",

address = "Germany",

}

TY - GEN

T1 - Speeding up XTR

AU - Stam, M

AU - Lenstra, AK

N1 - Conference Proceedings/Title of Journal: Advances in Cryptology - ASIACRYPT 2001, 7th International Conference on the Theory and Application of Cryptology and Information Security, Gold Coast, Australia, December 9-13, 2001, Proceedings

PY - 2001/12

Y1 - 2001/12

N2 - 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.

AB - 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.

M3 - Conference Contribution (Conference Proceeding)

SN - 3540429875

VL - 2248

SP - 125

EP - 143

BT - Advances in Cryptology - ASIACRYPT 2001

PB - Springer Berlin Heidelberg

ER -

Speeding up XTR

Abstract

Bibliographical note

Access to Document

Handle.net

Fingerprint

Cite this