TY - JOUR
T1 - A Parallel Strategy for Solving Sparse Linear Systems over Finite Fields
AU - Rivera-Zamarripa, Luis
AU - Adj, Gora
AU - Aguilar-Ibanez, Carlos
AU - Cruz-Cortes, Nareli
AU - Rodriguez-Henriquez, Francisco
N1 - Publisher Copyright:
© 2022 Instituto Politecnico Nacional. All rights reserved.
PY - 2022
Y1 - 2022
N2 - 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 F36_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.
AB - 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 F36_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.
KW - Linear algebra
KW - finite field
KW - parallel computing
UR - http://www.scopus.com/inward/record.url?scp=85130834463&partnerID=8YFLogxK
U2 - 10.13053/CyS-26-1-3494
DO - 10.13053/CyS-26-1-3494
M3 - Artículo
AN - SCOPUS:85130834463
SN - 1405-5546
VL - 26
SP - 493
EP - 504
JO - Computacion y Sistemas
JF - Computacion y Sistemas
IS - 1
ER -