Efficient non symmetric pairing groups on ordinary pairing friendly curve of embedding degree 1

Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Communications, ICC 2011
DOIs
Publication statusPublished - Sep 2 2011
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: Jun 5 2011Jun 9 2011

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period6/5/116/9/11

Keywords

  • embedding degree 1
  • non-symmetric pairing
  • pairing
  • twist

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Efficient non symmetric pairing groups on ordinary pairing friendly curve of embedding degree 1'. Together they form a unique fingerprint.

Cite this