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
Kami mengkaji penyongsangan pantas bagi fungsi penyulitan Paillier. Terutamanya, kami hanya menumpukan pada penjanaan kunci, dan tidak mengubah suai fungsi penyulitan Paillier. Kami mencadangkan tiga algoritma penjanaan utama berdasarkan teknik mempercepatkan untuk fungsi penyulitan RSA. Dengan menggunakan algoritma kami, saiz eksponen CRT persendirian adalah separuh daripada saiz Paillier-CRT. Algoritma pertama menggunakan algoritma Euclidean lanjutan. Algoritma kedua menggunakan algoritma pemfaktoran, dan boleh membina eksponen CRT persendirian dengan berat Hamming yang rendah. Algoritma ketiga ialah varian daripada yang kedua, dan mempunyai beberapa kelebihan seperti pemampatan eksponen CRT persendirian dan tiada keperluan untuk algoritma pemfaktoran. Kami juga mencadangkan tetapan parameter untuk algoritma ini dan menganalisis keselamatan fungsi penyulitan Paillier oleh algoritma ini terhadap serangan yang diketahui. Akhir sekali, kami memberikan hasil percubaan algoritma kami.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -