Name
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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1587/transfun.E93.A.1111 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
Paillier's encryption function, key generation, inversion, RSA, Chinese remainder theorem | Discrete mathematics,Key generation,Exponent,Chinese remainder theorem,Paillier cryptosystem,Extended Euclidean algorithm,Algorithm,Theoretical computer science,Encryption,Probabilistic encryption,Hamming weight,Mathematics | Journal |
Volume | Issue | ISSN |
E93A | 6 | 0916-8508 |
Citations | PageRank | References |
0 | 0.34 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Takato Hirano | 1 | 11 | 3.87 |
| Keisuke Tanaka | 2 | 278 | 19.04 |