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
Paillier 암호화 기능의 빠른 역전을 연구합니다. 특히, 키 생성에만 중점을 두고 Paillier 암호화 기능을 수정하지 않습니다. RSA 암호화 기능의 속도 향상 기법을 기반으로 세 가지 키 생성 알고리즘을 제안한다. 우리 알고리즘을 사용하면 개인 CRT 지수의 크기가 Paillier-CRT 지수의 절반입니다. 첫 번째 알고리즘은 확장된 유클리드 알고리즘을 사용합니다. 두 번째 알고리즘은 인수분해 알고리즘을 사용하며 낮은 해밍 가중치로 전용 CRT 지수를 구성할 수 있습니다. 세 번째 알고리즘은 두 번째 알고리즘의 변형이며 개인 CRT 지수의 압축 및 인수분해 알고리즘이 필요하지 않은 등의 몇 가지 장점이 있습니다. 우리는 또한 이러한 알고리즘에 대한 매개변수 설정을 제안하고 알려진 공격에 대해 이러한 알고리즘을 통해 Paillier 암호화 기능의 보안을 분석합니다. 마지막으로 알고리즘의 실험 결과를 제공합니다.
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.
부
Takato HIRANO, Keisuke TANAKA, "Key Generation for Fast Inversion of the Paillier Encryption Function" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 6, pp. 1111-1121, June 2010, doi: 10.1587/transfun.E93.A.1111.
Abstract: We study fast inversion of the Paillier encryption function. Especially, we focus only on key generation, and do not modify the Paillier encryption function. We propose three key generation algorithms based on the speeding-up techniques for the RSA encryption function. By using our algorithms, the size of the private CRT exponent is half of that of Paillier-CRT. The first algorithm employs the extended Euclidean algorithm. The second algorithm employs factoring algorithms, and can construct the private CRT exponent with low Hamming weight. The third algorithm is a variant of the second one, and has some advantage such as compression of the private CRT exponent and no requirement for factoring algorithms. We also propose the settings of the parameters for these algorithms and analyze the security of the Paillier encryption function by these algorithms against known attacks. Finally, we give experimental results of our algorithms.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.1111/_p
부
@ARTICLE{e93-a_6_1111,
author={Takato HIRANO, Keisuke TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Key Generation for Fast Inversion of the Paillier Encryption Function},
year={2010},
volume={E93-A},
number={6},
pages={1111-1121},
abstract={We study fast inversion of the Paillier encryption function. Especially, we focus only on key generation, and do not modify the Paillier encryption function. We propose three key generation algorithms based on the speeding-up techniques for the RSA encryption function. By using our algorithms, the size of the private CRT exponent is half of that of Paillier-CRT. The first algorithm employs the extended Euclidean algorithm. The second algorithm employs factoring algorithms, and can construct the private CRT exponent with low Hamming weight. The third algorithm is a variant of the second one, and has some advantage such as compression of the private CRT exponent and no requirement for factoring algorithms. We also propose the settings of the parameters for these algorithms and analyze the security of the Paillier encryption function by these algorithms against known attacks. Finally, we give experimental results of our algorithms.},
keywords={},
doi={10.1587/transfun.E93.A.1111},
ISSN={1745-1337},
month={June},}
부
TY - JOUR
TI - Key Generation for Fast Inversion of the Paillier Encryption Function
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1111
EP - 1121
AU - Takato HIRANO
AU - Keisuke TANAKA
PY - 2010
DO - 10.1587/transfun.E93.A.1111
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2010
AB - We study fast inversion of the Paillier encryption function. Especially, we focus only on key generation, and do not modify the Paillier encryption function. We propose three key generation algorithms based on the speeding-up techniques for the RSA encryption function. By using our algorithms, the size of the private CRT exponent is half of that of Paillier-CRT. The first algorithm employs the extended Euclidean algorithm. The second algorithm employs factoring algorithms, and can construct the private CRT exponent with low Hamming weight. The third algorithm is a variant of the second one, and has some advantage such as compression of the private CRT exponent and no requirement for factoring algorithms. We also propose the settings of the parameters for these algorithms and analyze the security of the Paillier encryption function by these algorithms against known attacks. Finally, we give experimental results of our algorithms.
ER -