### 抜粋

A discrete logarithm problem with auxiliary input (DLPwAI) is a problem to find α from G, αG, α ^{d}G in an additive cyclic group generated by an element G of prime order r, and a positive integer d satisfying d|(r - 1). The infeasibility of this problem assures the security of some cryptographic schemes. In 2006, Cheon proposed a novel algorithm for solving DLPwAI (Cheon's algorithm). This paper reports our experimental results of Cheon's algorithm by implementing it with some speeding-up techniques. In fact, we have succeeded to solve DLPwAI on a pairing-friendly elliptic curve of 160-bit order in 1314 core days. Implications of our experiments on cryptographic schemes are also discussed.

元の言語 | 英語 |
---|---|

ホスト出版物のタイトル | Public Key Cryptography, PKC 2012 - 15th International Conference on Practice and Theory in Public Key Cryptography, Proceedings |

ページ | 595-608 |

ページ数 | 14 |

DOI | |

出版物ステータス | 出版済み - 6 5 2012 |

外部発表 | Yes |

イベント | 15th International Conference on Practice and Theory in Public Key Cryptography, PKC 2012 - Darmstadt, ドイツ 継続期間: 5 21 2012 → 5 23 2012 |

### 出版物シリーズ

名前 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

巻 | 7293 LNCS |

ISSN（印刷物） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### その他

その他 | 15th International Conference on Practice and Theory in Public Key Cryptography, PKC 2012 |
---|---|

国 | ドイツ |

市 | Darmstadt |

期間 | 5/21/12 → 5/23/12 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## フィンガープリント Solving a discrete logarithm problem with auxiliary input on a 160-bit elliptic curve' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Public Key Cryptography, PKC 2012 - 15th International Conference on Practice and Theory in Public Key Cryptography, Proceedings*(pp. 595-608). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 7293 LNCS). https://doi.org/10.1007/978-3-642-30057-8_35