標数3の超特異楕円曲線上のηTペアリングの高速実装

Abstract

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 / HistoryMade available in DSpace on 2012-04-18T01:10:31Z (GMT). No. of bitstreams: 2 math149.pdf: 412991 bytes, checksum: ceef9c914b485e00995a9ef91ebc9ceb (MD5) math149_abstract.pdf: 162468 bytes, checksum: eca64bb0ccf2f7d8b0621e292c24130e (MD5)Submitted by 真弓 小柳 ([email protected]) on 2012-04-18T01:10:31Z No. of bitstreams: 2 math149.pdf: 412991 bytes, checksum: ceef9c914b485e00995a9ef91ebc9ceb (MD5) math149_abstract.pdf: 162468 bytes, checksum: eca64bb0ccf2f7d8b0621e292c24130e (MD5)主1数理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 schemes 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