Jul 20, 2006
Pairing Computation with MNT Curve over All One Polynomial Field
IPSJ SIG Notes
- ,
- ,
- ,
- Volume
- 2006
- Number
- 81
- First page
- 13
- Last page
- 18
- Language
- Japanese
- Publishing type
- Publisher
- Information Processing Society of Japan (IPSJ)
In recent years, many cryptographic applications with bilinear-pairing over elliptic curves have been proposed. The well-known MNT curves, that are non-supersingular elliptic curves, provide bilinear-pairings over extension fields of degree 3, 4, and 6. When the embedding degree is equal to 3, MNT curves cannot be defined over optimal extension field (OEF). Even when the embedding degree is equal to 4 or 6, MNT curves cannot be always defined over OEF. For some of such cases, it can be defined over all one polynomial field (AOPF). Since Frobenius mapping can be fast carried out in the AOPFs, this paper gives considered some improvements for Tate pairing calculation. Then, some examples and simulation results are shown.
- Link information
- ID information
-
- ISSN : 0919-6072
- CiNii Articles ID : 110004821006
- CiNii Books ID : AA11235941