<?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-55462022000100493</article-id>
<article-id pub-id-type="doi">10.13053/cys-26-1-3494</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Parallel Strategy for Solving Sparse Linear Systems over Finite Fields]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rivera-Zamarripa]]></surname>
<given-names><![CDATA[Luis]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Adj]]></surname>
<given-names><![CDATA[Gora]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Aguilar-Ibáñez]]></surname>
<given-names><![CDATA[Carlos]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Cruz-Cortés]]></surname>
<given-names><![CDATA[Nareli]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rodríguez-Henríquez]]></surname>
<given-names><![CDATA[Francisco]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
<xref ref-type="aff" rid="Aaf"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Technology Innovation Institute Cryptography Research Centre ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>United Arab Emirates</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universitat de Lleida Department de Matemàtica ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Spain</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Investigación en Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af4">
<institution><![CDATA[,Instituto Politécnico Nacional Centro de Investigación y de Estudios Avanzados Computer Science Department]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<volume>26</volume>
<numero>1</numero>
<fpage>493</fpage>
<lpage>504</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462022000100493&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-55462022000100493&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-55462022000100493&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: In this paper we describe a number of parallel techniques that were applied to the problem of finding the null-spaces of thousands of large sparse matrices. This collection of matrices were derived from the discrete logarithm problem attack over the finite field    F   3  6 &#8901; 509 recently carried out by Adj et al. in [2]. Our software library was mainly executed in the supercomputer ABACUS [7], where in total   21 , 870 large sparse linear algebra systems were processed. Solving those linear algebra problems involved a computational effort of over   138 core-years, requiring a memory space of over 645 gigabytes to store the corresponding vector solutions.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Linear algebra]]></kwd>
<kwd lng="en"><![CDATA[finite field]]></kwd>
<kwd lng="en"><![CDATA[parallel computing]]></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[Adj]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Discrete logarithms in small characteristic finite fields: attacking Type 1 pairing-based cryptography]]></source>
<year>2016</year>
<publisher-loc><![CDATA[Mexico ]]></publisher-loc>
<publisher-name><![CDATA[Departamento de Computación]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adj]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Canales-Martínez]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Cruz-Cortés]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Menezes]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Oliveira]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Rivera-Zamarripa]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez-Henríquez]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields]]></source>
<year>2016</year>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adj]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Menezes]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Oliveira]]></surname>
<given-names><![CDATA[T.]]></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[Computing discrete logarithms in F36&#8901;137 and F36&#8901;163 using magma]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Koç]]></surname>
<given-names><![CDATA[Ç. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Mesnager]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Savas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Arithmetic of Finite Fields - 5th International Workshop, WAIFI 2014]]></source>
<year>2014</year>
<volume>9061</volume>
<page-range>3-22</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Adj]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Menezes]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Oliveira]]></surname>
<given-names><![CDATA[T.]]></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[Weakness of F36&#8901;509 for discrete logarithm cryptography]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Cao]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Pairing-Based Cryptography - Pairing 2013 - 6th International Conference]]></source>
<year>2014</year>
<volume>8365</volume>
<page-range>20-44</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Barrett]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor]]></source>
<year>1987</year>
<conf-name><![CDATA[ Advances in cryptology&#8212;CRYPTO &#8217;86]]></conf-name>
<conf-loc> </conf-loc>
<page-range>311-23</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berlekamp]]></surname>
<given-names><![CDATA[E. R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algebraic Coding Theory]]></source>
<year>1968</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[McGraw-Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<collab>Cinvestav</collab>
<source><![CDATA[ABACUS supercomputer]]></source>
<year>2017</year>
<publisher-name><![CDATA[Cinvestav]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Coppersmith]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving homogeneous linear equations over GF[2] via block Wiedemann algorithm]]></article-title>
<source><![CDATA[Mathematics of Computation]]></source>
<year>1994</year>
<volume>62</volume>
<numero>205</numero>
<issue>205</issue>
<page-range>337-50</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Geiselmann]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Shamir]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Steinwandt]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Tromer]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scalable hardware for sparse systems of linear equations, with applications to integer factorization]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[J. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Sunar]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Cryptographic Hardware and Embedded Systems - CHES 2005, 7th International Workshop]]></source>
<year>2005</year>
<volume>3659</volume>
<page-range>131-46</page-range><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[Granger]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kleinjung]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Zumbrägel]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Breaking &#8217;128-bit secure&#8217; supersingular binary curves - (or how to solve discrete logarithms in F24&#8901;1223 and F212&#8901;367]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Garay]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gennaro]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference]]></source>
<year>2014</year>
<volume>8617</volume>
<page-range>126-45</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<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[Secaucus, NJ, USA ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag New York, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<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.]]></given-names>
</name>
</person-group>
<source><![CDATA[An Introduction to Mathematical Cryptography]]></source>
<year>2008</year>
<edition>1</edition>
<publisher-name><![CDATA[Springer Publishing Company, Incorporated]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jeljeli]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Accelerating iterative SpMV for the discrete logarithm problem using GPUs]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Koç]]></surname>
<given-names><![CDATA[Ç. K.]]></given-names>
</name>
<name>
<surname><![CDATA[Mesnager]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Savas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Arithmetic of Finite Fields - 5th International Workshop, WAIFI 2014]]></source>
<year>2014</year>
<volume>9061</volume>
<page-range>25-44</page-range><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[Jeljeli]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Resolution of linear algebra for the discrete logarithm problem using GPU and multi-core architectures]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Silva]]></surname>
<given-names><![CDATA[F. M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[de Castro Dutra]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Costa]]></surname>
<given-names><![CDATA[V. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Euro-Par 2014 Parallel Processing - 20th International Conference]]></source>
<year>2014</year>
<volume>8632</volume>
<page-range>764-75</page-range><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[Jeljeli]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Accélérateurs logiciels et matériels pour l&#8217;algèbre linéaire creuse sur les corps finis]]></source>
<year>2015</year>
<publisher-name><![CDATA[l&#8217;Université de Lorraine]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Joux]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pierrot]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Improving the polynomial time precomputation of frobenius representation discrete logarithm algorithms - simplified setting for small characteristic finite fields]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Sarkar]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Iwata]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Cryptology -ASIACRYPT 2014 - 20th International Conference on the Theory and Application of Cryptology and Information Security]]></source>
<year>2014</year>
<volume>8873</volume>
<page-range>378-97</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Joux]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pierrot]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Nearly sparse linear algebra and application to discrete logarithms computations]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaltofen]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Analysis of Coppersmith&#8217;s block Wiedemann algorithm for the parallel solution of sparse linear systems]]></article-title>
<source><![CDATA[Mathematics of Computation]]></source>
<year>1995</year>
<volume>64</volume>
<numero>210</numero>
<issue>210</issue>
<page-range>777-806</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaltofen]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Lobo]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Distributed matrix-free solution of large sparse linear systems over finite fields]]></article-title>
<source><![CDATA[Algorithmica]]></source>
<year>1999</year>
<volume>24</volume>
<numero>3&#8211;4</numero>
<issue>3&#8211;4</issue>
<page-range>331-48</page-range></nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaltofen]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Saunders]]></surname>
<given-names><![CDATA[B. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On Wiedemann&#8217;s method of solving sparse linear systems]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Mattson]]></surname>
<given-names><![CDATA[H. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Mora]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Rao]]></surname>
<given-names><![CDATA[T. R. N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Applied Algebra, Algebraic Algorithms and Error-Correcting Codes]]></source>
<year>1991</year>
<volume>539</volume>
<page-range>29-38</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lanczos]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An iteration method for the solution of the eigenvalue problem of linear differential and integral operators]]></article-title>
<source><![CDATA[J. Res. Nat&#8217;l Bur. Std.]]></source>
<year>1950</year>
<volume>45</volume>
<page-range>255-82</page-range></nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Massey]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Shift-register synthesis and BCH decoding]]></article-title>
<source><![CDATA[IEEE Trans. Inf. Theor.]]></source>
<year>1969</year>
<volume>15</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>122-7</page-range></nlm-citation>
</ref>
<ref id="B23">
<nlm-citation citation-type="">
<collab>OpenMP</collab>
<source><![CDATA[The OpenMP API specification for parallel programming]]></source>
<year>2015</year>
</nlm-citation>
</ref>
<ref id="B24">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tan]]></surname>
<given-names><![CDATA[X.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A new extrapolation method for PageRank computations]]></article-title>
<source><![CDATA[Journal of Computational and Applied Mathematics]]></source>
<year>2017</year>
<volume>313</volume>
<numero>Supplement C</numero>
<issue>Supplement C</issue>
<page-range>383-92</page-range></nlm-citation>
</ref>
<ref id="B25">
<nlm-citation citation-type="">
<collab>The CADO-NFS Development Team</collab>
<source><![CDATA[CADO-NFS, an implementation of the number field sieve algorithm]]></source>
<year>2017</year>
</nlm-citation>
</ref>
<ref id="B26">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tromer]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Hardware-Based Cryptanalysis]]></source>
<year>2007</year>
<publisher-name><![CDATA[Weizmann Institute of Science]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Villard]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Further analysis of coppersmith&#8217;s block Wiedemann algorithm for the solution of sparse linear systems (extended abstract)]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Char]]></surname>
<given-names><![CDATA[B. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[P. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Küchlin]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<source><![CDATA[Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC &#8217;97]]></source>
<year>1997</year>
<page-range>32-9</page-range><publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wiedemann]]></surname>
<given-names><![CDATA[D. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving sparse linear equations over finite fields]]></article-title>
<source><![CDATA[IEEE Trans. Inf. Theor.]]></source>
<year>1986</year>
<volume>32</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>54-62</page-range></nlm-citation>
</ref>
<ref id="B29">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[L. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Feng]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[Q.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An improved parallel block Lanczos algorithm over GF(2) for integer factorization]]></article-title>
<source><![CDATA[Inf. Sci.]]></source>
<year>2017</year>
<volume>379</volume>
<page-range>257-73</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
