TY - GEN

T1 - Compressed XTR

AU - Shirase, Masaaki

AU - Han, Dong Guk

AU - Hibino, Yasushi

AU - Kim, Ho Won

AU - Takagi, Tsuyoshi

PY - 2007/12/1

Y1 - 2007/12/1

N2 - XTR public key system was introduced at Crypto 2000, which is based on a method to present elements of a subgroup of a multiplicative group of a finite field. Its application in cryptographic protocols leads to substantial savings both in communication and computational overhead without compromising security. It was shown how the use of finite extension fields and subgroups can be combined in such a way that the number of bits to be exchanged is reduced by a factor 3. In this paper we show how to more compress the communication overhead. The compressed XTR leads to a factor 6 reduction in the representation size compared to the traditional representation and achieves as twice compactness as XTR. The computational overhead of it is a little worse than that of XTR, however the compressed XTR requires only about additional 6% computational effort. If finding 4-th roots of unity is pre-computed, then the computational overhead is only 1% compared to that of original XTR. Furthermore, the required size of public key data of it reduces about 26% from that of XTR.

AB - XTR public key system was introduced at Crypto 2000, which is based on a method to present elements of a subgroup of a multiplicative group of a finite field. Its application in cryptographic protocols leads to substantial savings both in communication and computational overhead without compromising security. It was shown how the use of finite extension fields and subgroups can be combined in such a way that the number of bits to be exchanged is reduced by a factor 3. In this paper we show how to more compress the communication overhead. The compressed XTR leads to a factor 6 reduction in the representation size compared to the traditional representation and achieves as twice compactness as XTR. The computational overhead of it is a little worse than that of XTR, however the compressed XTR requires only about additional 6% computational effort. If finding 4-th roots of unity is pre-computed, then the computational overhead is only 1% compared to that of original XTR. Furthermore, the required size of public key data of it reduces about 26% from that of XTR.

UR - http://www.scopus.com/inward/record.url?scp=38049038841&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049038841&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38049038841

SN - 9783540727378

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 420

EP - 431

BT - Applied Cryptography and Network Security - 5th International Conference, ACNS 2007, Proceedings

T2 - 5th International Conference on Applied Cryptography and Network Security, ACNS 2007

Y2 - 5 June 2007 through 8 June 2007

ER -