<Doctoral Thesis>
Efficient Implementation of ηT Pairing on Supersingular Elliptic Curves in Characteristic 3

Creator
Examiner
Language
Academic Year Conferred
Conferring University
Degree
Degree Type
Publication Type
Access Rights
JaLC DOI
Abstract 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.show more
Table of Contents 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
show more

Hide fulltext details.

pdf math149 pdf 403 KB 426 本文
pdf math149_abstract pdf 158 KB 233 要旨

Details

Record ID
Peer-Reviewed
Keywords
Report Number
Number of Diploma
Granted Date
Date Accepted
Faculty
Location
Location
Call Number
Notes
Created Date 2013.07.12
Modified Date 2023.11.21

People who viewed this item also viewed