Ordinary pairing friendly curve of embedding degree 1 whose order has two large prime factors

Tetsuya Izuta, Yasuyuki Nogami, Yoshitaka Morikawa

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

2 Citations (Scopus)

Abstract

This paper proposes a method for generating a certain composite order ordinary pairing-friendly elliptic curve of embedding degree 1. In detail, the order has two large prime factors such as the modulus of RSA cryptography. The method is based on a property that the order of the target pairing-friendly curve is given by a cyclotomic polynomial as r(x) of degree 2 with respect to the integer variable x. When the bit size of the prime factors is almost 1000 bits, the proposed method averagely takes about 20 hours on Core 2 Duo (3.0GHz) for generating one.

Original languageEnglish
Title of host publicationTENCON 2010 - 2010 IEEE Region 10 Conference
Pages769-772
Number of pages4
DOIs
Publication statusPublished - 2010
Event2010 IEEE Region 10 Conference, TENCON 2010 - Fukuoka, Japan
Duration: Nov 21 2010Nov 24 2010

Publication series

NameIEEE Region 10 Annual International Conference, Proceedings/TENCON

Other

Other2010 IEEE Region 10 Conference, TENCON 2010
CountryJapan
CityFukuoka
Period11/21/1011/24/10

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Ordinary pairing friendly curve of embedding degree 1 whose order has two large prime factors'. Together they form a unique fingerprint.

  • Cite this

    Izuta, T., Nogami, Y., & Morikawa, Y. (2010). Ordinary pairing friendly curve of embedding degree 1 whose order has two large prime factors. In TENCON 2010 - 2010 IEEE Region 10 Conference (pp. 769-772). [5686593] (IEEE Region 10 Annual International Conference, Proceedings/TENCON). https://doi.org/10.1109/TENCON.2010.5686593