Ordinary Pairing Friendly Curve of Embedding Degree 1 Whose Order Has Two Large Prime Factors

• Nogami Yasuyuki

• Yanagi Erika

• Izuta Tetsuya

• Morikawa Yoshitaka

抄録

Recently, composite order pairing–based cryptographies have received much attention. The composite order needs to be as large as the RSA modulus. Thus, they require a certain pairing–friendly elliptic curve that has such a large composite order. This paper proposes an efficient algorithm for generating an ordinary pairing–friendly elliptic curve of the embedding degree 1 whose order has two large prime factors as the RSA modulus. In addition, the generated pairing–friendly curve has an efficient structure for the Gallant–Lambert–Vanstone (GLV) method.

収録刊行物

• Memoirs of the Faculty of Engineering, Okayama University

  Memoirs of the Faculty of Engineering, Okayama University 45 46-53, 2011-01

  Faculty of Engineering, Okayama University

詳細情報

• CRID: 1390853649752944512
• NII論文ID: 120002905955
• NII書誌ID: AA12014085
• ISSN: 13496115
• DOI: 10.18926/44499
• Web Site: https://ousar.lib.okayama-u.ac.jp/44499
• 本文言語コード: en
• データソース種別:
  • JaLC
  • IRDB
  • CiNii Articles