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은 암호문의 통신 대역폭을 압축할 수 있는 가장 효율적인 공개 키 암호화 시스템 중 하나입니다. 하위 그룹을 배포하여 컴팩트한 표현을 얻을 수 있습니다. Fq2 확장 필드의 Fq6, XTR 암호화 시스템의 압축 비율은 1/3입니다. 반면, 다이크는 외. 토러스를 사용하여 효율적인 공개 키 암호화 시스템을 제안했습니다. Fq30 압축률은 4/15입니다. 압축 비율이 4/15보다 작은 효율적인 공개 키 암호화 시스템을 구축하는 것은 공개된 문제입니다. 본 논문에서 우리는 압축 비율이 1/6인 특성 XNUMX을 갖는 유한 필드에 대한 XTR 암호 시스템의 새로운 변형을 제안합니다. 주요 관찰은 Fq6 에 Fq 특성 1의 경우. 또한 압축 및 압축 해제 알고리즘 비용은 원래 XTR 암호화 시스템에 비해 약 XNUMX%의 오버헤드만 필요합니다. 따라서 제안된 XTR 암호 시스템의 변형은 가장 작은 압축 비율을 갖는 가장 빠른 공개 키 암호 시스템 중 하나입니다.
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.
부
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
부
@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},}
부
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 -