Nearly Sparse Linear Algebra and application to Discrete Logarithms Computations

Antoine Joux 1 Cécile Pierrot 1
1 ALMASTY - ALgorithms for coMmunicAtion SecuriTY
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this article, we propose a method to perform linear algebra on a matrix with nearly sparse properties. More precisely, although we require the main part of the matrix to be sparse, we allow some dense columns with possibly large coefficients. This is achieved by modifying the Block Wiedemann algorithm. Under some precisely stated conditions on the choices of initial vectors in the algorithm, we show that our variation not only produces a random solution of a linear system but gives a full basis of the set of solutions. Moreover, when the number of heavy columns is small, the cost of dealing with them becomes negligible. In particular, this eases the computation of discrete logarithms in medium and high characteristic finite fields, where nearly sparse matrices naturally occur.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01154879
Contributor : Antoine Joux <>
Submitted on : Saturday, August 25, 2018 - 11:57:40 AM
Last modification on : Thursday, March 21, 2019 - 1:13:12 PM
Long-term archiving on : Monday, November 26, 2018 - 1:38:07 PM

File

JouxAntoine-v25mars-HAL.pdf
Files produced by the author(s)

Identifiers

Citation

Antoine Joux, Cécile Pierrot. Nearly Sparse Linear Algebra and application to Discrete Logarithms Computations. Contemporary Developments in Finite Fields and Applications , 2016, 978-981-4719-27-8 ⟨10.1142/9789814719261_0008⟩. ⟨hal-01154879v2⟩

Share

Metrics

Record views

140

Files downloads

293