GPU acceleration of dense matrix and block operations for Lanczos method for systems over GF (2)
NL Zamarashkin, DA Zheltkov - Lobachevskii Journal of Mathematics, 2019 - Springer
The algebraic operations with the dense matrices and blocks are bounding the scalability of
block Lanczos–Montgomery method, that is used for the linear part in the RSA …
block Lanczos–Montgomery method, that is used for the linear part in the RSA …
Attribute reduction of boolean matrix in neighborhood rough set model
Y Gao, C Lv, Z Wu - International Journal of Computational Intelligence …, 2020 - Springer
Neighborhood rough set is a powerful tool to deal with continuous value information
systems. Graphics processing unit (GPU) computing can efficiently accelerate the …
systems. Graphics processing unit (GPU) computing can efficiently accelerate the …
GPU-accelerated scalable solver for large linear systems over finite fields
I Gupta, P Verma, V Deshpande… - … , Distributed and Grid …, 2018 - ieeexplore.ieee.org
Solving large and dense linear systems over finite fields (GF (2)) forms the basis for several
crypt-analytic techniques. Many popular cryptographic algorithms like Number Field Sieve …
crypt-analytic techniques. Many popular cryptographic algorithms like Number Field Sieve …
A Study on Optimization of Sparse and Dense Linear System Solver Over GF (2) on GPUs
P Verma, K Sharma - Innovations in Computer Science and Engineering …, 2021 - Springer
There are various crypt-analytic techniques where solving a large dense or sparse system of
linear equations over finite field becomes a challenge due to high computation. For instance …
linear equations over finite field becomes a challenge due to high computation. For instance …