Large sparse matrix-vector multiplication over finite fields

Date

2019

Author

Mangır, Ceyda

Metadata

Show full item record

Item Usage Stats

8
views

1
downloads

Cite This

Cryptographic computations such as factoring integers and computing discrete logarithms require solving a large sparse system of linear equations over finite fields. When dealing with such systems iterative solvers such as Wiedemann or Lanczos algorithms are used. The computational cost of both methods is often dominated by successive matrix-vector products. In this thesis, we introduce a new algorithm for computing a large sparse matrix-vector multiplication over finite fields. The proposed algorithm is implemented and its performance is compared with a classical method. Our algorithm exhibits a significant improvements between 34% and 77%.

Subject Keywords

Logarithms., Cryptography., Sparse matrices., Data encryption (Computer science).

URI

http://etd.lib.metu.edu.tr/upload/12623107/index.pdf
https://hdl.handle.net/11511/28018

Collections

Graduate School of Applied Mathematics, Thesis