<?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-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462024000401703</article-id>
<article-id pub-id-type="doi">10.13053/cys-28-4-4298</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Efficiency Evaluation of a Modified Montgomery Multiplication Systolic Architecture Implemented on an FPGA]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Morales-Romero]]></surname>
<given-names><![CDATA[José de Jesús]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Reyes-Barranca]]></surname>
<given-names><![CDATA[Mario Alfredo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Tinoco-Varela]]></surname>
<given-names><![CDATA[David]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Flores-Nava]]></surname>
<given-names><![CDATA[Luis Martín]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Espinosa-García]]></surname>
<given-names><![CDATA[Emilio Rafael]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Centro de Investigación y de Estudios Avanzados  ]]></institution>
<addr-line><![CDATA[Ciudad de México ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Autónoma de México Facultad de Estudios Superiores Cuautitlán ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2024</year>
</pub-date>
<volume>28</volume>
<numero>4</numero>
<fpage>1703</fpage>
<lpage>1714</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462024000401703&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-55462024000401703&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-55462024000401703&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: This work presents an improved algorithm applied to a systolic architecture when a modular multiplication is synthesized into a Field Programmable Gate Array (FPGA). Here, we proved how this proposed architecture for modular multiplication can be employed in a modular exponentiation process. Modular exponentiation is critical and helps in the performance of algorithms like RSA, Digital Signature, Elliptic Curve, and other cryptographic algorithms. Results obtained show that these improvements in the systolic architecture speed up the performance and reduces also the resources used by the programmable device, specifically when the Montgomery modular multiplication is used. Also, we compare the results of this work with related work published in the literature.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Modular multiplication]]></kwd>
<kwd lng="en"><![CDATA[montgomery modular multiplication]]></kwd>
<kwd lng="en"><![CDATA[modular exponentiation]]></kwd>
<kwd lng="en"><![CDATA[systolic architecture]]></kwd>
<kwd lng="en"><![CDATA[FPGA]]></kwd>
<kwd lng="en"><![CDATA[RSA]]></kwd>
<kwd lng="en"><![CDATA[elliptic curve cryptography]]></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[Barrett]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor]]></article-title>
<source><![CDATA[Advances in Cryptology]]></source>
<year>1987</year>
<page-range>311-23</page-range><publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blum]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Paar]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Montgomery modular exponentiation on reconfigurable hardware]]></source>
<year>1999</year>
<conf-name><![CDATA[ 14th IEEE Symposium on Computer Arithmetic]]></conf-name>
<conf-loc> </conf-loc>
<page-range>70-7</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brickell]]></surname>
<given-names><![CDATA[E. F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A fast modular multiplication algorithm with application to two key cryptography]]></article-title>
<source><![CDATA[Advances in Cryptology]]></source>
<year>1983</year>
<page-range>51-60</page-range><publisher-loc><![CDATA[US ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chow]]></surname>
<given-names><![CDATA[G. C. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Eguro]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Luk]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Leong]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[A karatsuba-based montgomery multiplier]]></source>
<year>2010</year>
<conf-name><![CDATA[ International Conference on Field Programmable Logic and Applications]]></conf-name>
<conf-loc> </conf-loc>
<page-range>434-7</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gowda]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Shaila]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Venugopal]]></surname>
<given-names><![CDATA[K. R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Elliptic curve cryptography implementation on FPGA using montgomery multiplication for equal key and data size over GF(2m) for wireless sensor networks]]></source>
<year>2016</year>
<conf-name><![CDATA[ Region 10 Conference]]></conf-name>
<conf-loc> </conf-loc>
<page-range>468-71</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kuang]]></surname>
<given-names><![CDATA[S. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[K. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[R. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Low-cost high-performance VLSI architecture for montgomery modular multiplication]]></article-title>
<source><![CDATA[IEEE Transactions on Very Large Scale Integration (VLSI) Systems]]></source>
<year>2016</year>
<volume>24</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>434-43</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[A design and implementation of montgomery modular multiplier]]></source>
<year>2019</year>
<conf-name><![CDATA[ International Symposium on Circuits and Systems]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1-4</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[McIvor]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[McLoone]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[McCanny]]></surname>
<given-names><![CDATA[J. V.]]></given-names>
</name>
</person-group>
<source><![CDATA[Fast montgomery modular multiplication and RSA cryptographic processor architectures]]></source>
<year>2003</year>
<volume>1</volume>
<conf-name><![CDATA[ 37th Asilomar Conference on Signals, Systems Computers]]></conf-name>
<conf-loc> </conf-loc>
<page-range>379-84</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[McIvor]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[McLoone]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[McCanny]]></surname>
<given-names><![CDATA[J. V.]]></given-names>
</name>
</person-group>
<source><![CDATA[High-radix systolic modular multiplication on reconfigurable hardware]]></source>
<year>2005</year>
<conf-name><![CDATA[ International Conference on Field-Programmable Technology]]></conf-name>
<conf-loc> </conf-loc>
<page-range>13-8</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Menezes]]></surname>
<given-names><![CDATA[A. J.]]></given-names>
</name>
<name>
<surname><![CDATA[van-Oorschot]]></surname>
<given-names><![CDATA[P. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Vanstone]]></surname>
<given-names><![CDATA[S. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of applied cryptography]]></source>
<year>2018</year>
<publisher-name><![CDATA[CRC press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Montgomery]]></surname>
<given-names><![CDATA[P. L.]]></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="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mrabet]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[El-Mrabet]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Lashermes]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rigaud]]></surname>
<given-names><![CDATA[J. B.]]></given-names>
</name>
<name>
<surname><![CDATA[Bouallegue]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Mesnager]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Machhout]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A scalable and systolic architectures of montgomery modular multiplication for public key cryptosystems based on DSPs]]></article-title>
<source><![CDATA[Journal of Hardware and Systems Security]]></source>
<year>2017</year>
<volume>10076</volume>
<page-range>219-36</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Orup]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Simplifying quotient determination in high-radix modular multiplication]]></source>
<year>1995</year>
<conf-name><![CDATA[ 12th Symposium on Computer Arithmetic]]></conf-name>
<conf-loc> </conf-loc>
<page-range>193-9</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Perin]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gomes]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Martins]]></surname>
<given-names><![CDATA[J. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Montgomery modular multiplication on reconfigurable hardware: Systolic versus multiplexed implementation]]></article-title>
<source><![CDATA[International Journal of Reconfigurable Computing]]></source>
<year>2011</year>
<volume>2011</volume>
<page-range>1-10</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rezai]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Keshavarzi]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Compact SD: A new encoding algorithm and its application in multiplication]]></article-title>
<source><![CDATA[International Journal of Computer Mathematics]]></source>
<year>2017</year>
<volume>94</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>554-69</page-range></nlm-citation>
</ref>
<ref id="B16">
<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]]></source>
<year>1978</year>
<volume>21</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>120-6</page-range></nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tenca]]></surname>
<given-names><![CDATA[A. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Koc]]></surname>
<given-names><![CDATA[C. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A scalable architecture for modular multiplication based on montgomery&#8217;s algorithm]]></article-title>
<source><![CDATA[IEEE Transactions on Computers]]></source>
<year>2003</year>
<volume>52</volume>
<numero>9</numero>
<issue>9</issue>
<page-range>1215-21</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Verma]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Dutta]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Vig]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[FPGA implementation of RSA based on carry save montgomery modular multiplication]]></source>
<year>2016</year>
<conf-name><![CDATA[ International Conference on Computational Techniques in Information and Communication Technologies]]></conf-name>
<conf-loc> </conf-loc>
<page-range>107-12</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Walter]]></surname>
<given-names><![CDATA[C. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Systolic modular multiplication]]></article-title>
<source><![CDATA[IEEE Transactions on Computers]]></source>
<year>1993</year>
<volume>42</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>376-8</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Walter]]></surname>
<given-names><![CDATA[C. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Montgomery exponentiation needs no final subtractions]]></article-title>
<source><![CDATA[Electronics Letters]]></source>
<year>1999</year>
<volume>35</volume>
<numero>21</numero>
<issue>21</issue>
<page-range>1831-2</page-range></nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Gao]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[High radix montgomery modular multiplier on modern FPGA]]></source>
<year>2013</year>
<conf-name><![CDATA[ 12th IEEE International Conference on Trust, Security and Privacy in Computing and Communications]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1484-9</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
