Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures
Identifieur interne : 000752 ( Ncbi/Curation ); précédent : 000751; suivant : 000753Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures
Auteurs : Maocai Wang [République populaire de Chine] ; Guangming Dai [République populaire de Chine] ; Kim-Kwang Raymond Choo [République populaire de Chine, États-Unis] ; Prem Prakash Jayaraman [Australie] ; Rajiv Ranjan [Royaume-Uni]Source :
- PLoS ONE [ 1932-6203 ] ; 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.
Url:
DOI: 10.1371/journal.pone.0161857
PubMed: 27564373
PubMed Central: 5001717
Links toward previous steps (curation, corpus...)
- to stream Pmc, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000601
- to stream Pmc, to step Curation: Pour aller vers cette notice dans l'étape Curation :000601
- to stream Pmc, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000039
- to stream Ncbi, to step Merge: Pour aller vers cette notice dans l'étape Curation :000752
Links to Exploration step
PMC:5001717Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures</title>
<author><name sortKey="Wang, Maocai" sort="Wang, Maocai" uniqKey="Wang M" first="Maocai" last="Wang">Maocai Wang</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>School of Computer, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>School of Computer, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><nlm:aff id="aff002"><addr-line>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Dai, Guangming" sort="Dai, Guangming" uniqKey="Dai G" first="Guangming" last="Dai">Guangming Dai</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>School of Computer, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>School of Computer, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><nlm:aff id="aff002"><addr-line>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Choo, Kim Kwang Raymond" sort="Choo, Kim Kwang Raymond" uniqKey="Choo K" first="Kim-Kwang Raymond" last="Choo">Kim-Kwang Raymond Choo</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>School of Computer, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>School of Computer, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><nlm:aff id="aff002"><addr-line>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
<affiliation wicri:level="2"><nlm:aff id="aff003"><addr-line>Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, Texas, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, Texas</wicri:regionArea>
<placeName><region type="state">Texas</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Jayaraman, Prem Prakash" sort="Jayaraman, Prem Prakash" uniqKey="Jayaraman P" first="Prem Prakash" last="Jayaraman">Prem Prakash Jayaraman</name>
<affiliation wicri:level="1"><nlm:aff id="aff004"><addr-line>RMIT University, Melbourne, Australia</addr-line>
</nlm:aff>
<country xml:lang="fr">Australie</country>
<wicri:regionArea>RMIT University, Melbourne</wicri:regionArea>
<wicri:noRegion>Melbourne</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ranjan, Rajiv" sort="Ranjan, Rajiv" uniqKey="Ranjan R" first="Rajiv" last="Ranjan">Rajiv Ranjan</name>
<affiliation wicri:level="1"><nlm:aff id="aff005"><addr-line>University of Newcastle, Newcastle, United Kingdom</addr-line>
</nlm:aff>
<country xml:lang="fr">Royaume-Uni</country>
<wicri:regionArea>University of Newcastle, Newcastle</wicri:regionArea>
<wicri:noRegion>Newcastle</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">PMC</idno>
<idno type="pmid">27564373</idno>
<idno type="pmc">5001717</idno>
<idno type="url">http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5001717</idno>
<idno type="RBID">PMC:5001717</idno>
<idno type="doi">10.1371/journal.pone.0161857</idno>
<date when="2016">2016</date>
<idno type="wicri:Area/Pmc/Corpus">000601</idno>
<idno type="wicri:Area/Pmc/Curation">000601</idno>
<idno type="wicri:Area/Pmc/Checkpoint">000039</idno>
<idno type="wicri:Area/Ncbi/Merge">000752</idno>
<idno type="wicri:Area/Ncbi/Curation">000752</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a" type="main">Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures</title>
<author><name sortKey="Wang, Maocai" sort="Wang, Maocai" uniqKey="Wang M" first="Maocai" last="Wang">Maocai Wang</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>School of Computer, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>School of Computer, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><nlm:aff id="aff002"><addr-line>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Dai, Guangming" sort="Dai, Guangming" uniqKey="Dai G" first="Guangming" last="Dai">Guangming Dai</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>School of Computer, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>School of Computer, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><nlm:aff id="aff002"><addr-line>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Choo, Kim Kwang Raymond" sort="Choo, Kim Kwang Raymond" uniqKey="Choo K" first="Kim-Kwang Raymond" last="Choo">Kim-Kwang Raymond Choo</name>
<affiliation wicri:level="1"><nlm:aff id="aff001"><addr-line>School of Computer, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>School of Computer, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1"><nlm:aff id="aff002"><addr-line>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei, China</addr-line>
</nlm:aff>
<country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Hubei Key Laboratory of Intelligent Geo-Information Processing, China University of Geosciences, Wuhan, Hubei</wicri:regionArea>
<wicri:noRegion>Hubei</wicri:noRegion>
</affiliation>
<affiliation wicri:level="2"><nlm:aff id="aff003"><addr-line>Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, Texas, United States of America</addr-line>
</nlm:aff>
<country xml:lang="fr">États-Unis</country>
<wicri:regionArea>Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, Texas</wicri:regionArea>
<placeName><region type="state">Texas</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Jayaraman, Prem Prakash" sort="Jayaraman, Prem Prakash" uniqKey="Jayaraman P" first="Prem Prakash" last="Jayaraman">Prem Prakash Jayaraman</name>
<affiliation wicri:level="1"><nlm:aff id="aff004"><addr-line>RMIT University, Melbourne, Australia</addr-line>
</nlm:aff>
<country xml:lang="fr">Australie</country>
<wicri:regionArea>RMIT University, Melbourne</wicri:regionArea>
<wicri:noRegion>Melbourne</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Ranjan, Rajiv" sort="Ranjan, Rajiv" uniqKey="Ranjan R" first="Rajiv" last="Ranjan">Rajiv Ranjan</name>
<affiliation wicri:level="1"><nlm:aff id="aff005"><addr-line>University of Newcastle, Newcastle, United Kingdom</addr-line>
</nlm:aff>
<country xml:lang="fr">Royaume-Uni</country>
<wicri:regionArea>University of Newcastle, Newcastle</wicri:regionArea>
<wicri:noRegion>Newcastle</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j">PLoS ONE</title>
<idno type="eISSN">1932-6203</idno>
<imprint><date when="2016">2016</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en"><p>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.</p>
</div>
</front>
<back><div1 type="bibliography"><listBibl><biblStruct><analytic><author><name sortKey="Dong, Mx" uniqKey="Dong M">MX Dong</name>
</author>
<author><name sortKey="Ota, K" uniqKey="Ota K">K Ota</name>
</author>
<author><name sortKey="Laurence, T" uniqKey="Laurence T">T Laurence</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Wang, L" uniqKey="Wang L">L. Wang</name>
</author>
<author><name sortKey="Tao, J" uniqKey="Tao J">J. Tao</name>
</author>
<author><name sortKey="Ranjan, R" uniqKey="Ranjan R">R. Ranjan</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Kepler, D" uniqKey="Kepler D">D Kepler</name>
</author>
<author><name sortKey="Heasley, P" uniqKey="Heasley P">P Heasley</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Zhao, J" uniqKey="Zhao J">J. Zhao</name>
</author>
<author><name sortKey="Wang, L" uniqKey="Wang L">L. Wang</name>
</author>
<author><name sortKey="Tao, J" uniqKey="Tao J">J. Tao</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Chen, D" uniqKey="Chen D">D. Chen</name>
</author>
<author><name sortKey="Liu, Z" uniqKey="Liu Z">Z. Liu</name>
</author>
<author><name sortKey="Wang, L" uniqKey="Wang L">L. Wang</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Wang, L" uniqKey="Wang L">L. Wang</name>
</author>
<author><name sortKey="Kurze, T" uniqKey="Kurze T">T. Kurze</name>
</author>
<author><name sortKey="Tao, J" uniqKey="Tao J">J. Tao</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Wang, L" uniqKey="Wang L">L. Wang</name>
</author>
<author><name sortKey="Fu, C" uniqKey="Fu C">C Fu</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Zhang, W" uniqKey="Zhang W">W. Zhang</name>
</author>
<author><name sortKey="Wang, L" uniqKey="Wang L">L. Wang</name>
</author>
<author><name sortKey="Liu, D" uniqKey="Liu D">D. Liu</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Wang, L" uniqKey="Wang L">L. Wang</name>
</author>
<author><name sortKey="Chen, D" uniqKey="Chen D">D. Chen</name>
</author>
<author><name sortKey="Hu, Y" uniqKey="Hu Y">Y. Hu</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Raymond, C" uniqKey="Raymond C">C Raymond</name>
</author>
<author><name sortKey="Kaur, H" uniqKey="Kaur H">H Kaur</name>
</author>
<author><name sortKey="Tao, X" uniqKey="Tao X">X Tao</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Raymond Choo, K" uniqKey="Raymond Choo K">K Raymond Choo</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Raymond Choo, K" uniqKey="Raymond Choo K">K Raymond Choo</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Dong, M" uniqKey="Dong M">M Dong</name>
</author>
<author><name sortKey="Ota, K" uniqKey="Ota K">K Ota</name>
</author>
<author><name sortKey="Laurence, T" uniqKey="Laurence T">T Laurence</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Dong, M" uniqKey="Dong M">M Dong</name>
</author>
<author><name sortKey="Li, H" uniqKey="Li H">H Li</name>
</author>
<author><name sortKey="Ota, K" uniqKey="Ota K">K Ota</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Mao, W" uniqKey="Mao W">W Mao</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Joye, M" uniqKey="Joye M">M. Joye</name>
</author>
<author><name sortKey="Neven, G" uniqKey="Neven G">G Neven</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Moody, D" uniqKey="Moody D">D. Moody</name>
</author>
<author><name sortKey="Peralta, R" uniqKey="Peralta R">R. Peralta</name>
</author>
<author><name sortKey="Perlner, R" uniqKey="Perlner R">R. Perlner</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Rahuman, A" uniqKey="Rahuman A">A Rahuman</name>
</author>
<author><name sortKey="Athisha, G" uniqKey="Athisha G">G Athisha</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Dai, G" uniqKey="Dai G">G Dai</name>
</author>
<author><name sortKey="Wang, M" uniqKey="Wang M">M Wang</name>
</author>
<author><name sortKey="Peng, L" uniqKey="Peng L">L Peng</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Miller, V" uniqKey="Miller V">V Miller</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Barreto, P" uniqKey="Barreto P">P Barreto</name>
</author>
<author><name sortKey="Galbraith, S" uniqKey="Galbraith S">S Galbraith</name>
</author>
<author><name sortKey="Eigeartaigh, C" uniqKey="Eigeartaigh C">C Eigeartaigh</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Barreto, P" uniqKey="Barreto P">P Barreto</name>
</author>
<author><name sortKey="Galbraith, S" uniqKey="Galbraith S">S Galbraith</name>
</author>
<author><name sortKey="Eigeartaigh, C" uniqKey="Eigeartaigh C">C Eigeartaigh</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Miyaji, A" uniqKey="Miyaji A">A Miyaji</name>
</author>
<author><name sortKey="Nakabayashi, M" uniqKey="Nakabayashi M">M Nakabayashi</name>
</author>
<author><name sortKey="Takano, S" uniqKey="Takano S">S Takano</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Menezes, A" uniqKey="Menezes A">A Menezes</name>
</author>
<author><name sortKey="Okamoto, T" uniqKey="Okamoto T">T Okamoto</name>
</author>
<author><name sortKey="Vanstone, S" uniqKey="Vanstone S">S Vanstone</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Brezing, F" uniqKey="Brezing F">F Brezing</name>
</author>
<author><name sortKey="Weng, A" uniqKey="Weng A">A Weng</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Pollard, J" uniqKey="Pollard J">J Pollard</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Frey G And Ruck, H" uniqKey="Frey G And Ruck H">H Frey G and Ruck</name>
</author>
</analytic>
</biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct></biblStruct>
<biblStruct><analytic><author><name sortKey="Perera, C" uniqKey="Perera C">C Perera</name>
</author>
<author><name sortKey="Ranjan, R" uniqKey="Ranjan R">R Ranjan</name>
</author>
<author><name sortKey="Wang, L" uniqKey="Wang L">L Wang</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Kolodziej, J" uniqKey="Kolodziej J">J Kolodziej</name>
</author>
<author><name sortKey="Khan, S" uniqKey="Khan S">S Khan</name>
</author>
<author><name sortKey="Wang, L" uniqKey="Wang L">L Wang</name>
</author>
</analytic>
</biblStruct>
<biblStruct><analytic><author><name sortKey="Wei, J" uniqKey="Wei J">J Wei</name>
</author>
<author><name sortKey="Cai, W" uniqKey="Cai W">W Cai</name>
</author>
<author><name sortKey="Wang, L" uniqKey="Wang L">L Wang</name>
</author>
</analytic>
</biblStruct>
</listBibl>
</div1>
</back>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Ncbi/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000752 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Ncbi/Curation/biblio.hfd -nk 000752 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= CyberinfraV1 |flux= Ncbi |étape= Curation |type= RBID |clé= PMC:5001717 |texte= Constructing Pairing-Friendly Elliptic Curves under Embedding Degree 1 for Securing Critical Infrastructures }}
Pour générer des pages wiki
HfdIndexSelect -h $EXPLOR_AREA/Data/Ncbi/Curation/RBID.i -Sk "pubmed:27564373" \ | HfdSelect -Kh $EXPLOR_AREA/Data/Ncbi/Curation/biblio.hfd \ | NlmPubMed2Wicri -a CyberinfraV1
This area was generated with Dilib version V0.6.25. |