Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures

被引:0
|
作者
Wang, Maocai [1 ,2 ]
Dai, Guangming [1 ,2 ]
Choo, Kim-Kwang Raymond [1 ,2 ,3 ]
Jayaraman, Prem Prakash [4 ]
Ranjan, Rajiv [5 ]
机构
[1] China Univ Geosci, Sch Comp, Wuhan, Hubei, Peoples R China
[2] China Univ Geosci, Hubei Key Lab Intelligent Geoinformat Proc, Wuhan, Hubei, Peoples R China
[3] Univ Texas San Antonio, Dept Informat Syst & Cyber Secur, San Antonio, TX USA
[4] RMIT Univ, Melbourne, Vic, Australia
[5] Newcastle Univ, Newcastle Upon Tyne, Tyne & Wear, England
来源
PLOS ONE | 2016年 / 11卷 / 08期
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
G-HADOOP; CYBERINFRASTRUCTURE;
D O I
10.1371/journal.pone.0161857
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Information confidentiality is an essential requirement for cyber security in critical infrastructure. Identity-based cryptography, an increasingly popular branch of cryptography, is widely used to protect the information confidentiality in the critical infrastructure sector due to the ability to directly compute the user's public key based on the user's identity. However, computational requirements complicate the practical application of Identity-based cryptography. In order to improve the efficiency of identity-based cryptography, this paper presents an effective method to construct pairing-friendly elliptic curves with low hamming weight 4 under embedding degree 1. Based on the analysis of the Complex Multiplication(CM) method, the soundness of our method to calculate the characteristic of the finite field is proved. And then, three relative algorithms to construct pairing-friendly elliptic curve are put forward. 10 elliptic curves with low hamming weight 4 under 160 bits are presented to demonstrate the utility of our approach. Finally, the evaluation also indicates that it is more efficient to compute Tate pairing with our curves, than that of Bertoni et al.
引用
收藏
页数:13
相关论文
共 50 条
  • [31] ON THE NUMBER OF ISOGENY CLASSES OF PAIRING-FRIENDLY ELLIPTIC CURVES AND STATISTICS OF MNT CURVES
    Jimenez Urroz, Jorge
    Luca, Florian
    Shparlinski, Igor E.
    MATHEMATICS OF COMPUTATION, 2012, 81 (278) : 1093 - 1110
  • [32] On the non-idealness of cyclotomic families of pairing-friendly elliptic curves
    Sha, Min
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2014, 8 (04) : 417 - 440
  • [33] On the rho-values of complete families of pairing-friendly elliptic curves
    Okano, Keiji
    JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2012, 6 (3-4) : 249 - 268
  • [34] A Construction Method of Final Exponentiation for a Specific Cyclotomic Family of Pairing-Friendly Elliptic Curves with Prime Embedding Degrees
    Nanjo, Yuki
    Shirase, Masaaki
    Kodera, Yuta
    Kusaka, Takuya
    Nogami, Yasuyuki
    2021 NINTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR 2021), 2021, : 148 - 154
  • [35] Faster Ate Pairing Computation over Pairing-Friendly Elliptic Curves Using GLV Decomposition
    Eom, Soo Kyung
    Lee, Eunjeong
    Lee, Hyang-Sook
    ETRI JOURNAL, 2013, 35 (05) : 880 - 888
  • [36] Don’t Forget Pairing-Friendly Curves with Odd Prime Embedding Degrees
    Dai Y.
    Zhang F.
    Zhao C.-A.
    IACR Transactions on Cryptographic Hardware and Embedded Systems, 2023, 2023 (04): : 393 - 419
  • [37] Pairing-friendly elliptic curves with small security loss by Cheon's algorithm
    Comuta, Aya
    Kawazoe, Mitsuru
    Takahashi, Tetsuya
    INFORMATION SECURITY AND CRYPTOLOGY - ICISC 2007, 2007, 4817 : 297 - +
  • [38] Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
    El Housni, Youssef
    Guillevic, Aurore
    CRYPTOLOGY AND NETWORK SECURITY, CANS 2020, 2020, 12579 : 259 - 279
  • [39] An Implementation and Evaluation of a Pairing on Elliptic Curves with Embedding Degree 14
    Song, Zihao
    Matsumura, Rikuya
    Takahashi, Yuto
    Nanjo, Yuki
    Kusaka, Takuya
    Nogami, Yasuyuki
    Matsumoto, Tsutomu
    35TH INTERNATIONAL TECHNICAL CONFERENCE ON CIRCUITS/SYSTEMS, COMPUTERS AND COMMUNICATIONS (ITC-CSCC 2020), 2020, : 293 - 298
  • [40] Faster Beta Weil Pairing on BLS Pairing Friendly Curves with Odd Embedding Degree
    Azebaze Guimagang Laurian
    Fouotsa Emmanuel
    El Mrabet Nadia
    Pecha Njiahouo Aminatou
    Mathematics in Computer Science, 2022, 16