Mendeley出力
＜博士論文＞
標数3の超特異楕円曲線上のηTペアリングの高速実装
| 作成者 | |
|---|---|
| 論文調査委員 | |
| 本文言語 | |
| 学位授与年度 | |
| 学位授与大学 | |
| 学位 | |
| 学位種別 | |
| 出版タイプ | |
| アクセス権 | |
| JaLC DOI | |
| 概要 | Pairing-based cryptosystems can provide cryptographic schemes which have novel and useful properties, such as Identity-based encryption schemes, and they have been attracted in cryptography. These sch...emes are constructed by using pairings, such as the Tate and Weil pairings, hash functions, and group computations. Miller proposed the first polynomial-time algorithm for computing the Weil pairing on algebraic curves, and various pairings are indicated until now. ηT pairing over F_3m is one of the fastest pairings now.続きを見る |
| 目次 | Abstract Acknowledgements List of Tables List of Algorithms 1 Introduction 2 Mathematical Background 3 ηT Pairing over F_3m 4 The Detail of Implementation of ηT Pairing over F_3m 5 Construction of Addition and Subtraction in F_3 using Minimum Number of Logical Instructions 6 MapToPoint over Supersingular Elliptic Curves in F_3m 7 Experiment and Timing Results 8 Conclusion Bibliography History続きを見る |
本文ファイル
| ファイル | ファイルタイプ | サイズ | 閲覧回数 | 説明 |
|---|---|---|---|---|
math149
|
403 KB | 409 | 本文 | |
|
math149_abstract
|
158 KB | 220 | 要旨 |
詳細
| レコードID | |
|---|---|
| 査読有無 | |
| キーワード | |
| 報告番号 | |
| 学位記番号 | |
| 授与日(学位/助成/特許) | |
| 受理日 | |
| 部局 | |
| 所蔵場所 | |
| 所蔵場所 | |
| 所在記号 | |
| 注記 | |
| 登録日 | 2013.07.12 |
| 更新日 | 2023.11.21 |