<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1815-5928</journal-id>
<journal-title><![CDATA[Ingeniería Electrónica, Automática y Comunicaciones]]></journal-title>
<abbrev-journal-title><![CDATA[EAC]]></abbrev-journal-title>
<issn>1815-5928</issn>
<publisher>
<publisher-name><![CDATA[Universidad Tecnológica de La Habana José Antonio Echeverría, Cujae]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1815-59282020000300001</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Speeding up elliptic curve arithmetic on ARM processors using NEON instructions]]></article-title>
<article-title xml:lang="es"><![CDATA[Aceleración de la aritmética de curvas elípticas en procesadores ARM utilizando instrucciones NEON]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cuiman Márquez]]></surname>
<given-names><![CDATA[Raudel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cabrera Sarmiento]]></surname>
<given-names><![CDATA[Alejandro J.]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Sánchez-Solano]]></surname>
<given-names><![CDATA[Santiago]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de La Habana &#8220;José Antonio Echeverría&#8221;  ]]></institution>
<addr-line><![CDATA[ La Habana]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Instituto de Microelectrónica de Sevilla  ]]></institution>
<addr-line><![CDATA[ Sevilla]]></addr-line>
<country>España</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2020</year>
</pub-date>
<volume>41</volume>
<numero>3</numero>
<fpage>1</fpage>
<lpage>20</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S1815-59282020000300001&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S1815-59282020000300001&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S1815-59282020000300001&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT  This paper studies the use of NEON instructions for the implementation of elliptic curve cryptographic primitives on ARM Cortex-A processors. Starting from the analysis of point arithmetic formulas in different coordinate systems it was possible to identify several operations with no data dependency. Then, these operations were conveniently grouped in pairs to perform them in parallel using the NEON engine. Following this approach, dual NEON-based multiplications and squarings in the finite field     F p are proposed. Furthermore, these dual     F p operations are also used to speed up multiplications and squarings over the field extension     F   p 2. Finally, after integrating them into the point addition and point doubling formulas, we measure their impact on the execution time of scalar multiplications on elliptic curves defined over both finite fields. By using a mixed C/NEON implementation approach our solution is easily scalable at run time to support different curve sizes. Experiments conducted on the ARM Cortex-A9 processing system embedded in the Xilinx XC7Z020 device reported performance improvements of the NEON-based scalar multiplication between    32 % and    38 % and between    9 % and    34 % compared to a conventional implementation of the same operation on    254 -bit,    384 -bit and    510 -bit curves over     F p and     F   p 2 respectively.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN  Este trabajo estudia el empleo del repertorio de instrucciones NEON para la implementación de primitivas criptográficas de curvas elípticas sobre procesadores ARM Cortex-A. Realizando un análisis de las ecuaciones para la aritmética de puntos en diferentes sistemas de coordenadas fue posible identificar varias operaciones sin dependencia de datos entre ellas. De esta manera, dichas operaciones fueron agrupadas en pares para ser ejecutadas simultáneamente utilizando el coprocesador NEON. Siguiendo este enfoque se implementan operaciones de doble multiplicación y doble cuadrado en el campo finito     F p. Adicionalmente, estas operaciones dobles en     F p son empleadas para acelerar las operaciones de multiplicación y cuadrado sobre la extensión de campo     F   p 2. Finalmente, al integrar todas estas operaciones dentro de los procedimientos para suma y doblado de puntos, se mide el impacto de las mismas en el rendimiento de la multiplicación escalar en curvas elípticas definidas sobre ambos campos finitos. Gracias a una implementación mixta empleando C y NEON nuestra solución es fácilmente escalable en tiempo de ejecución para brindar soporte a varios tamaños de curva. Los experimentos realizados en el sistema de procesamiento ARM Cortex-A9 empotrado en el dispositivo XC7Z020 de Xilinx reportaron mejoras de rendimiento entre un 32% y un 38% y entre un 9% y un 34% para una multiplicación escalar basada en NEON con respecto a una implementación convencional de dicha operación en curvas de 254 , 384 y 510 bits sobre     F p y     F   p 2 respectivamente. Palabras claves: criptografía de curvas elípticas, multiplicación escalar, ARM Cortex-A, NEON.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[elliptic curve cryptography]]></kwd>
<kwd lng="en"><![CDATA[scalar point multiplication]]></kwd>
<kwd lng="en"><![CDATA[ARM Cortex-A processors]]></kwd>
<kwd lng="en"><![CDATA[NEON instruction set]]></kwd>
<kwd lng="es"><![CDATA[criptografía de curvas elípticas]]></kwd>
<kwd lng="es"><![CDATA[multiplicación escalar]]></kwd>
<kwd lng="es"><![CDATA[ARM Cortex-A]]></kwd>
<kwd lng="es"><![CDATA[NEON]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Miller]]></surname>
<given-names><![CDATA[VS]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Use of Elliptic Curves in Cryptography]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Williams]]></surname>
<given-names><![CDATA[HC]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Cryptology - CRYPTO '85, LNCS 218]]></source>
<year>1986</year>
<page-range>417-26</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koblitz]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Elliptic Curve Cryptosystems]]></article-title>
<source><![CDATA[Mathematics of Computation]]></source>
<year>1987</year>
<volume>48</volume>
<numero>177</numero>
<issue>177</issue>
<page-range>203-9</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="">
<collab>National Institute of Standards and Technology</collab>
<source><![CDATA[Digital Signature Standard (DSS) Gaithersburg]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="">
<collab>Certicom Research</collab>
<source><![CDATA[Elliptic Curve Cryptography]]></source>
<year>2009</year>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="">
<collab>Certicom Research</collab>
<source><![CDATA[Recommended Elliptic Curve Domain Parameters]]></source>
<year>2010</year>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="">
<collab>National Institute of Standards and Technology</collab>
<source><![CDATA[Recommendation for Pair-Wise Key-Establishment Schemes Using Discrete Logarithm Cryptography Gaithersburg]]></source>
<year>2018</year>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hankerson]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Menezes]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Vanstone]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Guide to Elliptic Curve Cryptography]]></source>
<year>2003</year>
<publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="">
<collab>Intel Corporation</collab>
<source><![CDATA[Using Streaming SIMD Extensions (SSE2) to Perform Big Multiplications]]></source>
<year>2000</year>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Seo]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Grobschadl]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Choi]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Montgomery Modular Multiplication on ARM-NEON Revisited]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Information Security and Cryptology - ICISC 2014, LNCS 8949]]></source>
<year>2015</year>
<page-range>328-42</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bos]]></surname>
<given-names><![CDATA[JW]]></given-names>
</name>
<name>
<surname><![CDATA[Montgomery]]></surname>
<given-names><![CDATA[PL]]></given-names>
</name>
<name>
<surname><![CDATA[Shumow]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Zaverucha]]></surname>
<given-names><![CDATA[GM]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Montgomery Multiplication Using Vector Instructions]]></article-title>
<collab>Lange</collab>
<source><![CDATA[Selected Areas in Cryptography - SAC 2013, LNCS]]></source>
<year>2013</year>
<page-range>471-89</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sánchez]]></surname>
<given-names><![CDATA[AH]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez-Henríquez]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[NEON Implementation of an Attribute-Based Encryption Scheme]]></article-title>
<collab>Jacobson</collab>
<source><![CDATA[Applied Cryptography and Network Security - ACNS 2013, LNCS 7954]]></source>
<year>2013</year>
<page-range>322-38</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bernstein]]></surname>
<given-names><![CDATA[DJ]]></given-names>
</name>
<name>
<surname><![CDATA[Schwabe]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[NEON Crypto]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Prouff]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
<name>
<surname><![CDATA[Schaumont]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<source><![CDATA[Cryptographic Hardware and Embedded Systems - CHES 2012, LNCS 7428]]></source>
<year>2012</year>
<page-range>320-39</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Faz-Hernández]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Longa]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez]]></surname>
<given-names><![CDATA[AH]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV-GLS curves]]></article-title>
<source><![CDATA[IACR ePrint archive]]></source>
<year>2013</year>
<volume>2013</volume>
<numero>158</numero>
<issue>158</issue>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Camara]]></surname>
<given-names><![CDATA[DF]]></given-names>
</name>
<name>
<surname><![CDATA[Gouvea]]></surname>
<given-names><![CDATA[CPL]]></given-names>
</name>
<name>
<surname><![CDATA[López]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Dahab]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<collab>Cuzzocrea</collab>
<source><![CDATA[Fast software polynomial multiplication on ARM processors using the NEON engine]]></source>
<year>2013</year>
<conf-name><![CDATA[ Security Engineering and Intelligence Informatics - CD-ARES 2013 Workshops: MoCrySEn and SeCIHD, LNCS 8128]]></conf-name>
<conf-loc> </conf-loc>
<page-range>137-54</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Longa]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[FourQNEON: Faster Elliptic Curve Scalar Multiplications on ARM processors]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Avanzi]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Heys]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
</person-group>
<source><![CDATA[Selected Areas in Cryptography - SAC 2016, LNCS 10532]]></source>
<year>2016</year>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Itoh]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Tsujii]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Fast Algorithm for Computing Multiplicative Inverses in GF(2]]></article-title>
<source><![CDATA[Information and Computation]]></source>
<year>1988</year>
<volume>78</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>171-7</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shoup]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<source><![CDATA[A Computational Introduction to Number Theory and Algebra]]></source>
<year>2009</year>
<edition>2nd</edition>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Montgomery]]></surname>
<given-names><![CDATA[PL]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Modular Multiplication without Trial Division]]></article-title>
<source><![CDATA[Mathematics of Computation]]></source>
<year>1985</year>
<volume>44</volume>
<numero>170</numero>
<issue>170</issue>
<page-range>519-21</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bernstein]]></surname>
<given-names><![CDATA[DJ]]></given-names>
</name>
<name>
<surname><![CDATA[Lange]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Mullen]]></surname>
<given-names><![CDATA[GLea]]></given-names>
</name>
</person-group>
<source><![CDATA[Analysis and optimization of elliptic-curve single-scalar multiplication]]></source>
<year>2007</year>
<conf-name><![CDATA[ Finite fields and applications: Eighth international conference on finite fields and applications]]></conf-name>
<conf-loc> </conf-loc>
<publisher-loc><![CDATA[Melbourne ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cohen]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Miyaji]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Ono]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficient Elliptic Curve Exponentiation Using Mixed Coordinates]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Ohta]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Pei]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Cryptology - ASIACRYPT '98, LNCS 6487]]></source>
<year>1998</year>
<page-range>1-20</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lauter]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
<name>
<surname><![CDATA[Montgomery]]></surname>
<given-names><![CDATA[PL]]></given-names>
</name>
<name>
<surname><![CDATA[Naehrig]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An Analysis of Affine Coordinates for Pairing Computation]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Joye]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Pairing-Based Cryptography - Pairing 2010, LNCS 6487]]></source>
<year>2010</year>
<page-range>1-20</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chudnovsky]]></surname>
<given-names><![CDATA[DV]]></given-names>
</name>
<name>
<surname><![CDATA[Chudnovsky]]></surname>
<given-names><![CDATA[GV]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Sequences of numbers generated by addition in formal groups and new primality and factorization tests]]></article-title>
<source><![CDATA[Advances in Applied Mathematics]]></source>
<year>1986</year>
<volume>7</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>385-434</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="">
<source><![CDATA[Explicit-Formulas Database]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="">
<collab>National Institute of Standards and Technology</collab>
<source><![CDATA[Recommendation for Key Management]]></source>
<year>2016</year>
</nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="">
<collab>ARM</collab>
<source><![CDATA[ARM Cortex-A Series Programmer's Guide Cambridge]]></source>
<year>2014</year>
</nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="">
<collab>ARM</collab>
<source><![CDATA[NEON Programmer's Guide Cambridge]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koc]]></surname>
<given-names><![CDATA[CK]]></given-names>
</name>
<name>
<surname><![CDATA[Acar]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Kaliski]]></surname>
<given-names><![CDATA[BS]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Analyzing and comparing Montgomery multiplication algorithms]]></article-title>
<source><![CDATA[IEEE Micro]]></source>
<year>1996</year>
<volume>16</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>26-33</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Menezes]]></surname>
<given-names><![CDATA[AJ]]></given-names>
</name>
<name>
<surname><![CDATA[Vanstone]]></surname>
<given-names><![CDATA[SA]]></given-names>
</name>
<name>
<surname><![CDATA[van Oorschot]]></surname>
<given-names><![CDATA[PC]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Applied Cryptography]]></source>
<year>1996</year>
<edition>1st</edition>
<publisher-loc><![CDATA[Boca Raton ]]></publisher-loc>
<publisher-name><![CDATA[CRC Press, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Knuth]]></surname>
<given-names><![CDATA[DE]]></given-names>
</name>
</person-group>
<source><![CDATA[The Art of Computer Programming]]></source>
<year>1997</year>
<volume>Volume 2: Seminumerical Algorithms</volume>
<edition>3rd</edition>
<publisher-loc><![CDATA[Boston ]]></publisher-loc>
<publisher-name><![CDATA[Addison-Wesley Longman Publishing Co.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barreto]]></surname>
<given-names><![CDATA[PSLM]]></given-names>
</name>
<name>
<surname><![CDATA[Naehrig]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Pairing-Friendly Elliptic Curves of Prime Order]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Preneel]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
<name>
<surname><![CDATA[Tavares]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Selected Areas in Cryptography - SAC 2005, LNCS 3897]]></source>
<year>2006</year>
<page-range>319-31</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hess]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Smart]]></surname>
<given-names><![CDATA[NP]]></given-names>
</name>
<name>
<surname><![CDATA[Vercauteren]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Eta Pairing Revisited]]></article-title>
<source><![CDATA[IEEE Transactions on Information Theory]]></source>
<year>2006</year>
<volume>52</volume>
<numero>10</numero>
<issue>10</issue>
<page-range>4595-602</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vercauteren]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Optimal Pairings]]></article-title>
<source><![CDATA[IEEE Transactions on Information Theory]]></source>
<year>2010</year>
<volume>56</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>455-61</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Scott]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Implementing Cryptographic Pairings]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Takagi]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<source><![CDATA[Pairing-Based Cryptography - Pairing]]></source>
<year>2007</year>
<page-range>177-96</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Devegili]]></surname>
<given-names><![CDATA[AJ]]></given-names>
</name>
<name>
<surname><![CDATA[O hEigeartaigh]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Scott]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Dahab]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Multiplication and Squaring on Pairing-Friendly Fields]]></article-title>
<source><![CDATA[IACR ePrint archive]]></source>
<year>2006</year>
</nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Weimerskirch]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Paar]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[Generalizations of the Karatsuba Algorithm for Efficient Implementations. IACR Eprint archive]]></source>
<year>2006</year>
</nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[CH]]></given-names>
</name>
<name>
<surname><![CDATA[Hwang]]></surname>
<given-names><![CDATA[HS]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fast Implementation of Elliptic Curve Arithmetic in GF(p]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Imai]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Zheng]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
</person-group>
<source><![CDATA[Public Key Cryptography - PKC 2000, LNCS 1751]]></source>
<year>2000</year>
<page-range>405-21</page-range><publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B37">
<label>37</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gallant]]></surname>
<given-names><![CDATA[RP]]></given-names>
</name>
<name>
<surname><![CDATA[Lambert]]></surname>
<given-names><![CDATA[RJ]]></given-names>
</name>
<name>
<surname><![CDATA[Vanstone]]></surname>
<given-names><![CDATA[SA]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Kilian]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Cryptology - CRYPTO 2001, LNCS 2139]]></source>
<year>2001</year>
<page-range>190-200</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B38">
<label>38</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koblitz]]></surname>
<given-names><![CDATA[AH]]></given-names>
</name>
<name>
<surname><![CDATA[Koblitz]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Menezes]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Elliptic curve cryptography: The serpentine course of a paradigm shift]]></article-title>
<source><![CDATA[Journal of Number Theory]]></source>
<year>2011</year>
<volume>131</volume>
<page-range>781-814</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
