Ordinary Pairing Friendly Curve of Embedding Degree 1 Whose Order Has Two Large Prime Factors
スポンサーリンク
概要
- 論文の詳細を見る
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.
論文 | ランダム
- アゾール化合物の薄層クロマトグラフィー
- ナフト(2,1-d)オキサゾール類の合成
- 光学活性s-トリアジン:α-(2-アニリノ-4-アミノ-s-トリアジン-6-イルアミノ)-β-チオールプロピオン酸の合成
- アセナフテン誘導体の合成に関する研究
- アミノナフタレンスルホン酸塩のアルカリ融解