<?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>2227-1899</journal-id>
<journal-title><![CDATA[Revista Cubana de Ciencias Informáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev cuba cienc informat]]></abbrev-journal-title>
<issn>2227-1899</issn>
<publisher>
<publisher-name><![CDATA[Editorial Ediciones Futuro]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2227-18992020000200098</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[La aritmética modular como mecanismo de seguridad y vulnerabilidad en el sistema criptográfico RSA]]></article-title>
<article-title xml:lang="en"><![CDATA[Modular arithmetic as a security and vulnerability mechanism in the RSA cryptographic system]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Janampa Patilla]]></surname>
<given-names><![CDATA[Hubner]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Nacional de San Cristóbal de Huamanga Facultad de Ingeniería Unidad de Investigación e Innovación]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Peru</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2020</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2020</year>
</pub-date>
<volume>14</volume>
<numero>2</numero>
<fpage>98</fpage>
<lpage>130</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992020000200098&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992020000200098&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992020000200098&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN La aritmética modular es la base matemática para el mecanismo de seguridad del sistema criptográfico de clave pública asimétrica RSA. Se mostrará los fundamentos matemáticos de la aritmética modular para el cifrado y descifrado de un texto plano, se definió la base sobre el uso de las operaciones aritméticas de adición, multiplicación y exponenciación sobre la aritmética módulo-n. Se mencionará los criterios de generación de dos números primos &#119901; y &#119902; para calcular la clave pública y privada mediante el algoritmo RSA. Se mostrará la importancia de la cantidad de cifras significativas de estos números primos como un mecanismo de seguridad para evitar la factorización de los mismos, además de las vulnerabilidades y ataques a nivel de protocolo; a nivel matemático y de canal lateral, que el sistema RSA posee debido al uso de la aritmética módulo-&#119899;. Se desarrolla e implementa en base al lenguaje de programación imperativo Python, la ejecución matemática del algoritmo RSA para la generación de las claves, el cifrado y el descifrado.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT Modular arithmetic is the mathematical basis for the security mechanism of the cryptographic system of RSA asymmetric public key. We will show the mathematical foundations of modular arithmetic for the encryption and decryption of a plain text, we define the basis on the use of arithmetic addition operations, multiplication and exponentiation on module-n arithmetic. We will mention the criteria for generating two prime numbers p and q to calculate the public and private key using the RSA algorithm. We will show the importance of the number of significant figures of these prime numbers as a security mechanism to avoid factoring them, in addition to vulnerabilities and attacks at the protocol level; to mathematical and lateral channel level, which the RSA system has due to the use of modulo-n arithmetic. I know develops and implements based on the imperative programming language Python, the mathematical execution of the RSA algorithm for key generation, encryption and decryption.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[aritmética modular]]></kwd>
<kwd lng="es"><![CDATA[cifrado]]></kwd>
<kwd lng="es"><![CDATA[descifrado]]></kwd>
<kwd lng="es"><![CDATA[RSA]]></kwd>
<kwd lng="es"><![CDATA[números primos]]></kwd>
<kwd lng="en"><![CDATA[modular arithmetic]]></kwd>
<kwd lng="en"><![CDATA[encryption]]></kwd>
<kwd lng="en"><![CDATA[decryption]]></kwd>
<kwd lng="en"><![CDATA[RSA]]></kwd>
<kwd lng="en"><![CDATA[prime number]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Baignères]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Junod]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[Y]]></given-names>
</name>
<name>
<surname><![CDATA[Monnerat]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Vaudenay]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[A Classical Introduction To Cryptography Exercise Book.]]></source>
<year>2006</year>
<page-range>181-6</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Biggs]]></surname>
<given-names><![CDATA[N.L]]></given-names>
</name>
</person-group>
<source><![CDATA[Codes: An Introduction to Information Communication and Cryptography.]]></source>
<year>2008</year>
<page-range>207-20</page-range><publisher-loc><![CDATA[Verlag London ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Daras]]></surname>
<given-names><![CDATA[N. J]]></given-names>
</name>
<name>
<surname><![CDATA[Rassias]]></surname>
<given-names><![CDATA[M. T]]></given-names>
</name>
</person-group>
<source><![CDATA[Computation, Cryptography, and Network Security]]></source>
<year>2015</year>
<page-range>1-9</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Daswani]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Kern]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Kesavan]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Foundations of Security What Every Programmer Needs to Know.]]></source>
<year>2007</year>
<page-range>221-38</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Apress]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Delfs]]></surname>
<given-names><![CDATA[H]]></given-names>
</name>
<name>
<surname><![CDATA[Kneb]]></surname>
<given-names><![CDATA[H. L]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Crytography Principles and Applications.]]></source>
<year>2007</year>
<edition>2nd edition</edition>
<page-range>33-80</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[Cryptographic Protocol, Security Analysis Based on Trusted Freshness.]]></source>
<year>2012</year>
<page-range>41-78</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dooley]]></surname>
<given-names><![CDATA[J.F]]></given-names>
</name>
</person-group>
<source><![CDATA[History of Cryptography and Cryptanalysis, Codes, Ciphers, and Their Algorithms]]></source>
<year>2018</year>
<page-range>185-202</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Epp]]></surname>
<given-names><![CDATA[S.S]]></given-names>
</name>
</person-group>
<source><![CDATA[Discrete Mathematics with Applications.]]></source>
<year>2019</year>
<edition>5th edition</edition>
<page-range>145-226</page-range><publisher-loc><![CDATA[EEUU ]]></publisher-loc>
<publisher-name><![CDATA[Cengage Learning]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gómez]]></surname>
<given-names><![CDATA[J.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Cryptography with Maple.]]></source>
<year>2013</year>
<page-range>419-61</page-range><publisher-loc><![CDATA[Verlag Berlin Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoffstein]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Pipher]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
<name>
<surname><![CDATA[Silverman]]></surname>
<given-names><![CDATA[J. H]]></given-names>
</name>
</person-group>
<source><![CDATA[An Introduction to Mathematical Cryptography.]]></source>
<year>2008</year>
<page-range>113-87</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Johnsonbaugh]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Discretre Mathematics.]]></source>
<year>2018</year>
<edition>eigtht edition</edition>
<page-range>214-54</page-range><publisher-loc><![CDATA[Chicago ]]></publisher-loc>
<publisher-name><![CDATA[Pearson Education]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Joye]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Tunstall]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Fault Analysis in Cryptography.]]></source>
<year>2012</year>
<page-range>1-15</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koblitz]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<source><![CDATA[A Course in Number Theory and Cryptography.]]></source>
<year>1994</year>
<edition>second edition</edition>
<page-range>83-124</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koblitz]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
</person-group>
<source><![CDATA[Algebraic Aspects of Cryptography.]]></source>
<year>2004</year>
<edition>3th edition</edition>
<page-range>18-52</page-range><publisher-loc><![CDATA[Verlag Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Koscielny]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Kurkowski]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Srebrny]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Modern Cryptography Primer Theoretical Foundations and Practical Applications]]></source>
<year>2013</year>
<page-range>36-76</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kranakis]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<source><![CDATA[Primality and Cryptography.]]></source>
<year>1986</year>
<page-range>138-53</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Wiley-Teubner Series in Computer Science]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kurose]]></surname>
<given-names><![CDATA[J.F]]></given-names>
</name>
<name>
<surname><![CDATA[Ross]]></surname>
<given-names><![CDATA[K. W]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer Networking A Top-Down Approach]]></source>
<year>2013</year>
<edition>6th edition</edition>
<page-range>671-754</page-range><publisher-loc><![CDATA[New Jersey ]]></publisher-loc>
<publisher-name><![CDATA[Addison-Wesley]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="">
<collab>Rsa Labs</collab>
<source><![CDATA[The rsa homonym. RSA Point of View]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lenstra]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Hughes]]></surname>
<given-names><![CDATA[J. P]]></given-names>
</name>
<name>
<surname><![CDATA[Augier]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Bos]]></surname>
<given-names><![CDATA[J.W.]]></given-names>
</name>
<name>
<surname><![CDATA[Kleinjung]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
<name>
<surname><![CDATA[Wachter]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
</person-group>
<source><![CDATA[Ron was wrong, whit is right. Technical report, IACR,]]></source>
<year>2012</year>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nisha]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
<name>
<surname><![CDATA[Farik]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[RSA public key cryptography algorithm a review.]]></article-title>
<source><![CDATA[International Journal Of Scientific Technology Research]]></source>
<year>2017</year>
<volume>6</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>187-9</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Paar]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Pelzl]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Understanding Cryptography, A Textbook for Students and Practitioners.]]></source>
<year>2010</year>
<page-range>173-204</page-range><publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pace]]></surname>
<given-names><![CDATA[G. J]]></given-names>
</name>
</person-group>
<source><![CDATA[Mathematics of Discrete Structures for Computer Science]]></source>
<year>2012</year>
<page-range>211-56</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Parthajit]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the abundance of large primes with small b-smooth values for p-1: An aspect of integer factorization.]]></article-title>
<source><![CDATA[International Journal on Computer Science and Engineering (IJCSE)]]></source>
<year>2018</year>
<volume>10</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>8</page-range></nlm-citation>
</ref>
<ref id="B24">
<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 cryptosystem]]></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></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rubinstein]]></surname>
<given-names><![CDATA[S. S]]></given-names>
</name>
</person-group>
<source><![CDATA[Cryptography]]></source>
<year>2010</year>
<page-range>113-27</page-range><publisher-loc><![CDATA[Palo Alto, CA, USA ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Salomaa]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Public Key Cryptography.]]></source>
<year>1996</year>
<edition>second edition</edition>
<page-range>125-57</page-range><publisher-loc><![CDATA[Berlin, Heidelberg ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Saranya]]></surname>
</name>
<name>
<surname><![CDATA[Vinothini]]></surname>
</name>
<name>
<surname><![CDATA[Vasumathi]]></surname>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A study on rsa algorithm for cryptography.]]></article-title>
<source><![CDATA[(IJCSIT) International Journal of Computer Science and Information Technologies]]></source>
<year>2014</year>
<volume>5</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>5708-9</page-range></nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Smart]]></surname>
<given-names><![CDATA[N. P]]></given-names>
</name>
</person-group>
<source><![CDATA[Cryptography Made Simple: Information Security and Cryptography.]]></source>
<year>2016</year>
<page-range>27-50</page-range><publisher-loc><![CDATA[Switzerland ]]></publisher-loc>
<publisher-name><![CDATA[Springer International Publishing]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Stallings]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[Cryptography and Network Security: Principles and Practice.]]></source>
<year>2014</year>
<edition>sixth edition</edition>
<page-range>253-85</page-range><publisher-loc><![CDATA[EEUU ]]></publisher-loc>
<publisher-name><![CDATA[Prentice Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B30">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sweigart]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Hacking Secret Ciphers with Python]]></source>
<year>2013</year>
<page-range>378-420</page-range><publisher-loc><![CDATA[United States ]]></publisher-loc>
<publisher-name><![CDATA[Released under Creative Commons BY-NCSA]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B31">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tilborg]]></surname>
<given-names><![CDATA[H. C. A]]></given-names>
</name>
<name>
<surname><![CDATA[Jajodia]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Encyclopedia of Cryptography and Security.]]></source>
<year>2011</year>
<edition>second edition</edition>
<page-range>795-7</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B32">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vaudenay]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[A Classical Introduction To Cryptography, Applications for Communications Security.]]></source>
<year>2006</year>
<page-range>229-50</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
