| 作成者 |
|
|
|
|
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 号 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
| 関連DOI |
|
|
|
|
|
| 関連URI |
|
|
|
|
|
| 関連ISBN |
|
| 関連HDL |
|
| 関連情報 |
|
|
|
|
|
|
|
| 概要 |
There are two decision methods for the decomposition of multiple points on an elliptic curve, one based on Semaev's summation polynomials and the other based on Stange's elliptic nets. This paper pres...ents some relations between these two methods. Using these relations, we show that an index calculus attack for the elliptic curve discrete logarithm problem (ECDLP) over extension fields via an elliptic net is equivalent to such an attack via Semaev's summation polynomials.続きを見る
|
Mendeley出力
JMI2011A-9