Efficient Non Symmetric Pairing Groups on Ordinary Pairing Friendly Curve of Embedding Degree 1

Recently, ordinary pairing-friendly elliptic curves whose embedding degree is 1 have been often focused on, for example some composite order pairing-based cryptographies do. In the case of non-symmetric pairings whose embedding degree is larger than 2, recent efficient pairing techniques such as Rat...

Full description

Saved in:
Bibliographic Details
Published in2011 IEEE International Conference on Communications (ICC) pp. 1 - 5
Main Authors Izuta, T., Nogami, Y., Morikawa, Y.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2011
Subjects
Acceleration
Elliptic curve cryptography
Elliptic curves
IEEE Communications Society
Polynomials
Online AccessGet full text

Cover

More Information
Summary:Recently, ordinary pairing-friendly elliptic curves whose embedding degree is 1 have been often focused on, for example some composite order pairing-based cryptographies do. In the case of non-symmetric pairings whose embedding degree is larger than 2, recent efficient pairing techniques such as Rate and Xate pairings adopt a certain special rational point group with an efficient isomorphic mapping and then accelerate pairing-related operations such as a pairing calculation and a scalar multiplication. Based on cubic, quartic, and sextic twists, this paper shows how to activate these efficient techniques together with point compression on pairing-friendly curves of embedding degree 1.
ISBN:9781612842325
1612842321
ISSN:1550-3607
1938-1883
DOI:10.1109/icc.2011.5962421