The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
XTR est l'un des systèmes de cryptographie à clé publique les plus efficaces qui nous permettent de compresser la bande passante de communication de leur texte chiffré. La représentation compacte peut être obtenue en déployant un sous-groupe Fq2 du champ d'extension Fq6, de sorte que le taux de compression du cryptosystème XTR soit de 1/3. En revanche, Dijk et al. a proposé un système de cryptographie à clé publique efficace utilisant un tore sur Fq30 dont le taux de compression est de 4/15. La construction d’un système cryptographique à clé publique efficace dont le taux de compression est inférieur à 4/15 constitue un problème ouvert. Dans cet article nous proposons une nouvelle variante du cryptosystème XTR sur des champs finis de caractéristique trois dont le taux de compression est de 1/6. L'observation clé est qu'il existe une carte de traces de Fq6 à Fq dans le cas de la caractéristique trois. De plus, le coût de l’algorithme de compression et de décompression ne nécessite qu’environ 1 % de surcharge par rapport au système de cryptographie XTR d’origine. Par conséquent, la variante proposée du cryptosystème XTR est l’un des cryptosystèmes à clé publique les plus rapides avec le plus petit taux de compression.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Masaaki SHIRASE, Dong-Guk HAN, Yasushi HIBINO, Howon KIM, Tsuyoshi TAKAGI, "A More Compact Representation of XTR Cryptosystem" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 10, pp. 2843-2850, October 2008, doi: 10.1093/ietfec/e91-a.10.2843.
Abstract: XTR is one of the most efficient public-key cryptosystems that allow us to compress the communication bandwidth of their ciphertext. The compact representation can be achieved by deploying a subgroup Fq2 of extension field Fq6, so that the compression ratio of XTR cryptosystem is 1/3. On the other hand, Dijk et al. proposed an efficient public-key cryptosystem using a torus over Fq30 whose compression ratio is 4/15. It is an open problem to construct an efficient public-key cryptosystem whose compression ratio is smaller than 4/15. In this paper we propose a new variant of XTR cryptosystem over finite fields with characteristic three whose compression ratio is 1/6. The key observation is that there exists a trace map from Fq6 to Fq in the case of characteristic three. Moreover, the cost of compression and decompression algorithm requires only about 1% overhead compared with the original XTR cryptosystem. Therefore, the proposed variant of XTR cryptosystem is one of the fastest public-key cryptosystems with the smallest compression ratio.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.10.2843/_p
Copier
@ARTICLE{e91-a_10_2843,
author={Masaaki SHIRASE, Dong-Guk HAN, Yasushi HIBINO, Howon KIM, Tsuyoshi TAKAGI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A More Compact Representation of XTR Cryptosystem},
year={2008},
volume={E91-A},
number={10},
pages={2843-2850},
abstract={XTR is one of the most efficient public-key cryptosystems that allow us to compress the communication bandwidth of their ciphertext. The compact representation can be achieved by deploying a subgroup Fq2 of extension field Fq6, so that the compression ratio of XTR cryptosystem is 1/3. On the other hand, Dijk et al. proposed an efficient public-key cryptosystem using a torus over Fq30 whose compression ratio is 4/15. It is an open problem to construct an efficient public-key cryptosystem whose compression ratio is smaller than 4/15. In this paper we propose a new variant of XTR cryptosystem over finite fields with characteristic three whose compression ratio is 1/6. The key observation is that there exists a trace map from Fq6 to Fq in the case of characteristic three. Moreover, the cost of compression and decompression algorithm requires only about 1% overhead compared with the original XTR cryptosystem. Therefore, the proposed variant of XTR cryptosystem is one of the fastest public-key cryptosystems with the smallest compression ratio.},
keywords={},
doi={10.1093/ietfec/e91-a.10.2843},
ISSN={1745-1337},
month={October},}
Copier
TY - JOUR
TI - A More Compact Representation of XTR Cryptosystem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2843
EP - 2850
AU - Masaaki SHIRASE
AU - Dong-Guk HAN
AU - Yasushi HIBINO
AU - Howon KIM
AU - Tsuyoshi TAKAGI
PY - 2008
DO - 10.1093/ietfec/e91-a.10.2843
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2008
AB - XTR is one of the most efficient public-key cryptosystems that allow us to compress the communication bandwidth of their ciphertext. The compact representation can be achieved by deploying a subgroup Fq2 of extension field Fq6, so that the compression ratio of XTR cryptosystem is 1/3. On the other hand, Dijk et al. proposed an efficient public-key cryptosystem using a torus over Fq30 whose compression ratio is 4/15. It is an open problem to construct an efficient public-key cryptosystem whose compression ratio is smaller than 4/15. In this paper we propose a new variant of XTR cryptosystem over finite fields with characteristic three whose compression ratio is 1/6. The key observation is that there exists a trace map from Fq6 to Fq in the case of characteristic three. Moreover, the cost of compression and decompression algorithm requires only about 1% overhead compared with the original XTR cryptosystem. Therefore, the proposed variant of XTR cryptosystem is one of the fastest public-key cryptosystems with the smallest compression ratio.
ER -