<?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>1405-7743</journal-id>
<journal-title><![CDATA[Ingeniería, investigación y tecnología]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. invest. y tecnol.]]></abbrev-journal-title>
<issn>1405-7743</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Facultad de Ingeniería]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-77432019000200006</article-id>
<article-id pub-id-type="doi">10.22201/fi.25940732e.2019.20n2.018</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Public hash signature for mobile network devices]]></article-title>
<article-title xml:lang="es"><![CDATA[Firma electrónica por medio de funciones hash para dispositivos móviles]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lizama-Pérez]]></surname>
<given-names><![CDATA[Luis Adrián]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Montiel-Arrieta]]></surname>
<given-names><![CDATA[Leonardo Javier]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Hernández-Mendoza]]></surname>
<given-names><![CDATA[Flor Seleyda]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lizama-Servín]]></surname>
<given-names><![CDATA[Luis Adrián]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Simancas-Acevedo]]></surname>
<given-names><![CDATA[Eric]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Politécnica de Pachuca Departamento de Posgrado ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Politécnica de Pachuca Departamento de Posgrado ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Politécnica de Pachuca Departamento de Posgrado ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Conacyt Centro de Ingeniería y Desarrollo Industrial Departamento de Posgrado]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="Af5">
<institution><![CDATA[,Universidad Politécnica de Pachuca Departamento de Posgrado ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2019</year>
</pub-date>
<volume>20</volume>
<numero>2</numero>
<fpage>0</fpage>
<lpage>0</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-77432019000200006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-77432019000200006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-77432019000200006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract In this work we have developed a digital signature protocol using hash functions that once implemented on mobile devices have demonstrated to be secure and efficient. It has been incorporated a model for a Certification Authority to exchange public keys between users. This work constitutes an experimental research, which bears a certain resemblance to theoretical research, but is not intended to propose a new theory, but to establish the behavior of a system to know its characteristics, in order to improve its knowledge and/or its performance.The hash signature system was tested on mobile communication devices. The experimental results show that the hash signature improves the efficiency to generate the cryptographic keys and the signing and verification processes when compared to ECC. Likewise, when generating 2048 keys, the hash signature is faster than RSA. In addition, the larger RSA keys consume a significative time, while the hash does not require to increase the size of the keys. Although we have not included here a formal analysis about the protocol, we highlight some points that improve the security of the proposed protocol. Finally, this work constitutes a new approach to public key cryptography based on hash functions that could be used to make digital signatures in electronic commerce. This method is suitable for mobile network devices due to the high speed and low hardware requirements of the hash functions. The method described here, which is compatible with hash functions, belongs to the field of post-quantum cryptography. The security of the method is based on the security of the hash cryptography, which is widely known and discussed.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen En este trabajo se ha desarrollado un protocolo de firma digital utilizando funciones hash que demuestra que es seguro, eficiente y adecuado para operar en dispositivos móviles. Además, se desarrolló el modelo de una Autoridad Certificadora para el intercambio seguro y eficiente de llaves públicas. El método que se utilizó fue la investigación experimental, que tiene cierta semejanza con la investigación teórica, pero no tiene por objeto plantear una teoría nueva, sino establecer el comportamiento de un sistema para conocer sus características, a fin de mejorar su conocimiento y su rendimiento. El sistema de firma hash fue implementado en dispositivos móviles. Los resultados experimentales demuestran que la firma hash mejora la eficiencia para generar las claves y los procesos de firma y verificación cuando se compara a ECC. Asimismo, al generar 2048 claves la firma hash es más rápida que RSA. Además, las claves RSA más grandes consumen mucho tiempo, mientras que el sistema hash no requiere aumentar el tamaño de las claves. Aunque no se ha incluido un análisis formal sobre la seguridad del protocolo, se destacan algunos puntos que mejoran la seguridad del protocolo propuesto. Finalmente, este trabajo constituye un nuevo enfoque para la criptografía de llave pública basada en funciones hash que podrían aprovecharse para realizar firmas digitales en comercio electrónico. Este método es adecuado para dispositivos de red móvil debido a la velocidad y los requisitos de hardware de las funciones hash. El método descrito aquí, el cual es compatible con las funciones hash, pertenece al campo de la criptografía post-cuántica. La seguridad del método se basa en la seguridad de la criptografía hash, la cual es ampliamente conocida y discutida.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Hash function]]></kwd>
<kwd lng="en"><![CDATA[hash chain]]></kwd>
<kwd lng="en"><![CDATA[Merkle tree]]></kwd>
<kwd lng="en"><![CDATA[digital signature]]></kwd>
<kwd lng="en"><![CDATA[mobile devices]]></kwd>
<kwd lng="es"><![CDATA[Función hash]]></kwd>
<kwd lng="es"><![CDATA[cadena hash]]></kwd>
<kwd lng="es"><![CDATA[Árbol de Merkle]]></kwd>
<kwd lng="es"><![CDATA[firma digital]]></kwd>
<kwd lng="es"><![CDATA[dispositivos móviles]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alese]]></surname>
<given-names><![CDATA[B.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Philemon]]></surname>
<given-names><![CDATA[E.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Falaki]]></surname>
<given-names><![CDATA[S.O.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Comparative analysis of public-key encryption schemes]]></article-title>
<source><![CDATA[International Journal of Engineering and Technology]]></source>
<year>2012</year>
<volume>2</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1552-68</page-range><publisher-name><![CDATA[Citeseer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Anderson]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Bergadano]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Crispo]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[J.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Manifavas]]></surname>
<given-names><![CDATA[Ch.]]></given-names>
</name>
<name>
<surname><![CDATA[Needham]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new family of authentication protocols]]></article-title>
<source><![CDATA[ACM SIGOPS Operating Systems Review]]></source>
<year>1998</year>
<volume>32</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>9-20</page-range><publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Buchmann]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Johannes]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Butin]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Florian]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Petzoldt]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Post-Quantum cryptography : state of the art. The New Codebreakers]]></source>
<year>2016</year>
<page-range>88-108</page-range><publisher-loc><![CDATA[Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Buchmann]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Dahmen]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Szydlo]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hash-Based digital signature schemes]]></article-title>
<source><![CDATA[Post-Quantum Cryptography]]></source>
<year>2009</year>
<page-range>35-93</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Buldas]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Laanoja]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Truu]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient implementation of keyless signatures with hash sequence authentication]]></source>
<year>2014</year>
<page-range>689</page-range><publisher-name><![CDATA[IACR Cryptology ePrint Archive]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Buldas]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Laanoja]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Truu]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient quantum-immune keyless signatures with identity]]></source>
<year>2014</year>
<page-range>321</page-range><publisher-name><![CDATA[Citeseer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dattani]]></surname>
<given-names><![CDATA[N.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Bryans]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Quantum factorization of 56153 with only 4 qubits]]></article-title>
<source><![CDATA[arXiv Preprint arXiv]]></source>
<year>2014</year>
<numero>1411.6758</numero>
<issue>1411.6758</issue>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<collab>DRAFT</collab>
<collab>FIPS PUB</collab>
<source><![CDATA[SHA-3 Standard: Permutation-Based hash and extendable-output functions]]></source>
<year>2014</year>
<publisher-name><![CDATA[Information Technology Laboratory, National Institute of Standards and Technology]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dridi]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Alghassi]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Prime factorization using quantum annealing and computational algebraic geometry]]></article-title>
<source><![CDATA[arXiv Preprint, arXiv]]></source>
<year>2016</year>
<numero>1604.05796</numero>
<issue>1604.05796</issue>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dwight]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Hash chain]]></article-title>
<source><![CDATA[Encyclopedia of cryptography and security]]></source>
<year>2011</year>
<page-range>542-3</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eastlake 3rd]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Jones]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[US secure hash algorithm 1 (SHA1)]]></source>
<year>2001</year>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="">
<collab>FIPS</collab>
<collab>NIST</collab>
<source><![CDATA[Digital Signature Standard]]></source>
<year>1998</year>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<collab>FIPS, PUB</collab>
<source><![CDATA[Digital Signature Standard (DSS)]]></source>
<year>2000</year>
<publisher-name><![CDATA[National Institute of Standards and Technology (NIST)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<collab>FIPS, PUB</collab>
<source><![CDATA[SECURE HASH STANDARD]]></source>
<year>2002</year>
<publisher-name><![CDATA[Federal information processing standards publication]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="">
<collab>FIPS, PUB</collab>
<source><![CDATA[Digital Signature Standard (DSS)]]></source>
<year>2009</year>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Groza]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Using one-way chains to provide message authentication without shared secrets]]></source>
<year>2006</year>
<conf-name><![CDATA[ Security, privacy and trust in pervasive and ubiquitous computing, 2006. SecPerU, Second International Workshop]]></conf-name>
<conf-loc> </conf-loc>
<page-range>82-7</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Haller]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<source><![CDATA[The S/KEY One-Time password system]]></source>
<year>1995</year>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hu]]></surname>
<given-names><![CDATA[Y.C.]]></given-names>
</name>
<name>
<surname><![CDATA[Jakobsson]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Perrig]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Efficient constructions for one-way hash chains]]></source>
<year>2005</year>
<conf-name><![CDATA[ International Conference on Applied Cryptography and Network Security]]></conf-name>
<conf-loc> </conf-loc>
<page-range>423-41</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Krawczyk]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Canetti]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Bellare]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[HMAC: Keyed-Hashing for message Authentication]]></source>
<year>1997</year>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lamport]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Password authentication with insecure communication]]></article-title>
<source><![CDATA[Communications of the ACM]]></source>
<year>1981</year>
<volume>24</volume>
<numero>11</numero>
<issue>11</issue>
<page-range>770-2</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lamport]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Constructing digital signatures from a one-way function]]></source>
<year>1979</year>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M&#8217;Raihi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Bellare]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hoornaert]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Naccache]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Ranen]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<source><![CDATA[Hotp: An hmac-based one-time password algorithm]]></source>
<year>2005</year>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[M&#8217;Raihi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Machani]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pei]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Rydell]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Totp: time-based one-time password algorithm]]></source>
<year>2011</year>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mahto]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Ali-Khan]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar-Yadav]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Security analysis of elliptic curve cryptography and RSA]]></source>
<year>2016</year>
<volume>1</volume>
<conf-name><![CDATA[ World Congress on Engineering]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Merkle]]></surname>
<given-names><![CDATA[R.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Method of providing digital signatures]]></source>
<year>1982</year>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Merkle]]></surname>
<given-names><![CDATA[R.C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A digital signature based on a conventional encryption function]]></article-title>
<source><![CDATA[Advances in Cryptology, CRYPTO 87]]></source>
<year>1987</year>
<page-range>369-78</page-range></nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Merkle]]></surname>
<given-names><![CDATA[R.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[A certified digital signature]]></source>
<year>1989</year>
<conf-name><![CDATA[ Conference on the Theory and Application of Cryptology]]></conf-name>
<conf-loc> </conf-loc>
<page-range>218-38</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Muñoz]]></surname>
<given-names><![CDATA[J.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Forne]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Esparza]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Soriano]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Certificate revocation system implementation based on the merkle hash tree]]></article-title>
<source><![CDATA[International Journal of Information Security]]></source>
<year>2004</year>
<volume>2</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>110-24</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nielsen]]></surname>
<given-names><![CDATA[M.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chuang]]></surname>
<given-names><![CDATA[I.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Quantum computation and quantum information]]></source>
<year>2010</year>
<publisher-name><![CDATA[Cambridge university press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nigel]]></surname>
<given-names><![CDATA[P.S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Hash functions, message authentication codes and key derivation functions]]></source>
<year>2016</year>
<page-range>271-94</page-range><publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Perlner]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cooper]]></surname>
<given-names><![CDATA[D.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Quantum resistant public key cryptography: A survey]]></source>
<year>2009</year>
<conf-name><![CDATA[ 8thSymposium on Identity and Trust on the Internet]]></conf-name>
<conf-loc> </conf-loc>
<page-range>85-93</page-range></nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Perrig]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Canetti]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Doug]]></surname>
<given-names><![CDATA[J.T.]]></given-names>
</name>
<name>
<surname><![CDATA[Song]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[The TESLA broadcast authentication protocol]]></source>
<year>2005</year>
<publisher-name><![CDATA[RSA]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B33">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rivest]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[The MD5 Message-Digest Algorithm]]></source>
<year>1992</year>
</nlm-citation>
</ref>
<ref id="B34">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rivest]]></surname>
<given-names><![CDATA[R.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Shamir]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Adleman]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Method for obtaining digital signatures and Public-Key cryptosystems]]></article-title>
<source><![CDATA[Communications of the ACM]]></source>
<year>1978</year>
<volume>21</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>120-6</page-range><publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B35">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shor]]></surname>
<given-names><![CDATA[P.W]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithms for quantum computation: Discrete logarithms and factoring]]></source>
<year>1994</year>
<conf-name><![CDATA[ Foundations of Computer Science, 1994 Proceedings, 35th Annual Symposium]]></conf-name>
<conf-loc> </conf-loc>
<page-range>124-34</page-range></nlm-citation>
</ref>
<ref id="B36">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tayoub]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lakehali]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Noureddine]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Implementation of Public-Key cryptographic systems on embedded devices (case : Computation speed)]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B37">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Triwinarko]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Elliptic curve digital signature algorithm (ECDSA)]]></source>
<year>2006</year>
<publisher-loc><![CDATA[Bandung ]]></publisher-loc>
<publisher-name><![CDATA[Program Studi Teknik Informatika ITB]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B38">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zohar]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Bitcoin: Under the hood]]></article-title>
<source><![CDATA[Communications of the ACM]]></source>
<year>2015</year>
<volume>58</volume>
<numero>9</numero>
<issue>9</issue>
<publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
