| Revista: | Computación y sistemas |
| Base de datos: | |
| Número de sistema: | 000560650 |
| ISSN: | 1405-5546 |
| Autores: | Rivera Zamarripa, Luis1 Adj, Gora2 Aguilar Ibáñez, Carlos3 Cruz Cortés, Nareli3 Rodríguez Henríquez, Francisco1 |
| Instituciones: | 1Technology Innovation Institute, Cryptography Research Centre, Emiratos Árabes Unidos 2Universitat de Lleida, Department de Matemàtica, Cataluña. España 3Instituto Politécnico Nacional, Centro de Investigación en Computación, México 4Instituto Politécnico Nacional, Centro de Investigación y de Estudios Avanzados, México |
| Año: | 2022 |
| Periodo: | Ene-Mar |
| Volumen: | 26 |
| Número: | 1 |
| Paginación: | 493-504 |
| País: | México |
| Idioma: | Inglés |
| Resumen en inglés | 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 ⋅ 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. |
| Keyword: | Linear algebra, Finite field, Parallel computing |
| Texto completo: | Texto completo (Ver HTML) Texto completo (Ver PDF) |
