Solving large sparse linear systems over the field GF(2)
Sokolova, Ekaterina (2016)
Diplomityö
Sokolova, Ekaterina
2016
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe201604159690
https://urn.fi/URN:NBN:fi-fe201604159690
Tiivistelmä
Nowadays problem of solving sparse linear systems over the field GF(2) remain as a challenge. The popular approach is to improve existing methods such as the block Lanczos method (the Montgomery method) and the Wiedemann-Coppersmith method. Both these methods are considered in the thesis in details: there are their modifications and computational estimation for each process. It demonstrates the most complicated parts of these methods and gives the idea how to improve computations in software point of view.
The research provides the implementation of accelerated binary matrix operations computer library which helps to make the progress steps in the Montgomery and in the Wiedemann-Coppersmith methods faster.
The research provides the implementation of accelerated binary matrix operations computer library which helps to make the progress steps in the Montgomery and in the Wiedemann-Coppersmith methods faster.