### 抄録

In this paper, we study short exponent Diffie-Hellman problems, where significantly many lower bits are zeros in the exponent. We first prove that the decisional version of this problem is as hard as two well known hard problems, the standard decisional Diffie-Hellman problem (DDH) and the short exponent discrete logarithm problem. It implies that we can improve the efficiency of ElGamal scheme and Cramer-Shoup scheme under the two widely accepted assumptions. We next derive a similar result for the computational version of this problem.

元の言語 | English |
---|---|

ページ（範囲） | 173-186 |

ページ数 | 14 |

ジャーナル | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

巻 | 2947 |

出版物ステータス | Published - 2004 |

外部発表 | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### これを引用

**Short exponent diffie-hellman problems.** / Koshiba, Takeshi; Kurosawa, Kaoru.

研究成果: Article

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*, 巻. 2947, pp. 173-186.

}

TY - JOUR

T1 - Short exponent diffie-hellman problems

AU - Koshiba, Takeshi

AU - Kurosawa, Kaoru

PY - 2004

Y1 - 2004

N2 - In this paper, we study short exponent Diffie-Hellman problems, where significantly many lower bits are zeros in the exponent. We first prove that the decisional version of this problem is as hard as two well known hard problems, the standard decisional Diffie-Hellman problem (DDH) and the short exponent discrete logarithm problem. It implies that we can improve the efficiency of ElGamal scheme and Cramer-Shoup scheme under the two widely accepted assumptions. We next derive a similar result for the computational version of this problem.

AB - In this paper, we study short exponent Diffie-Hellman problems, where significantly many lower bits are zeros in the exponent. We first prove that the decisional version of this problem is as hard as two well known hard problems, the standard decisional Diffie-Hellman problem (DDH) and the short exponent discrete logarithm problem. It implies that we can improve the efficiency of ElGamal scheme and Cramer-Shoup scheme under the two widely accepted assumptions. We next derive a similar result for the computational version of this problem.

UR - http://www.scopus.com/inward/record.url?scp=35048903103&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35048903103&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35048903103

VL - 2947

SP - 173

EP - 186

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -