Back to Search
Start Over
Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures.
- Source :
-
PloS one [PLoS One] 2016 Aug 26; Vol. 11 (8), pp. e0161857. Date of Electronic Publication: 2016 Aug 26 (Print Publication: 2016). - Publication Year :
- 2016
-
Abstract
- 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.<br />Competing Interests: The authors have declared that no competing interests exist.
- Subjects :
- Monte Carlo Method
Algorithms
Computer Security
Subjects
Details
- Language :
- English
- ISSN :
- 1932-6203
- Volume :
- 11
- Issue :
- 8
- Database :
- MEDLINE
- Journal :
- PloS one
- Publication Type :
- Academic Journal
- Accession number :
- 27564373
- Full Text :
- https://doi.org/10.1371/journal.pone.0161857