### 抜粋

The η_{T} pairing for supersingular elliptic curve over GF(3^{m}) has been paid attention because of its computational efficiency. Since most parts of computation of the η_{T} pairing are multiplications over GF(3^{m}), it is important to improve the speed of the multiplication when implementing the η_{T} pairing. In this paper we consider software implementation of multiplication over GF (3 ^{m}) and propose to use irreducible trinomials x^{m} + ax ^{k} + b over GF(3) such that w, bit length of word of targeted CPU, divides k. We call the trinomials "reduction optimal trinomials (ROTs)". ROTs actually exist for several m's and typical values of w = 16 and 32. We list them for extension degrees m = 97, 167, 193 and 239. These m's are derived from security considerations. Using ROT it is possible to implement efficient modulo operation (reduction) in multiplication over GF(3^{m}) comparing with the case using other type of trinomials (e.g., trinomials with minimum k for each m). The reason of this is that for the cases of reduction by ROT the number of shift operations on multiple precision data reduces to less than half comparing with the cases by other trinomials. Implementation results show that reduction algorithm specialized for ROT is 20-30% faster on 32-bit CPU and around 40% faster on 16-bit CPU than algorithm for irreducible trinomials with general k.

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

ホスト出版物のタイトル | Advances in Information and Computer Security - Second International Workshop on Security, IWSEC 2007, Proceedings |

ページ | 44-57 |

ページ数 | 14 |

出版物ステータス | 出版済み - 12 1 2007 |

イベント | 2nd International Workshop on Security, IWSEC 2007 - Nara, 日本 継続期間: 10 29 2007 → 10 31 2007 |

### 出版物シリーズ

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

巻 | 4752 LNCS |

ISSN（印刷物） | 0302-9743 |

ISSN（電子版） | 1611-3349 |

### その他

その他 | 2nd International Workshop on Security, IWSEC 2007 |
---|---|

国 | 日本 |

市 | Nara |

期間 | 10/29/07 → 10/31/07 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## フィンガープリント Reduction optimal trinomials for efficient software implementation of the η<sub>T</sub> pairing' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

_{T}pairing. ：

*Advances in Information and Computer Security - Second International Workshop on Security, IWSEC 2007, Proceedings*(pp. 44-57). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 4752 LNCS).