This paper deals with the performance analysis of the INM RAS implementation of the block
Lanczos-Montgomery method that was used to accomplish the factorization of the RSA-232 …

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 …

GPU based acceleration of computations with dense matrices and blocks over large prime
finite field are studied. Particular attention is paid to the following algorithms: multiplication of …

The block Lanczos method for huge sparse linear systems over large prime finite fields is
accelerated on GPU. Calculations on GPU are used for the operations with the dense …

Одним из наиболее популярных несимметричных алгоритмов шифрования,
используемых при передаче данных по сети, является алгоритм RSA [1]. Данный …

Solution of huge linear systems over large prime fields is a problem that arises in such
applications as discrete logarithm computation. Lanczos-Montgomery method is one of the …

Block Lanczos-Montgomery Method over Large Prime Fields with GPU Accelerated Dense
Operations Page 1 Block Lanczos-Montgomery Method over Large Prime Fields with GPU …

We consider different parallel versions of the least squares methods in the Krylov subspaces
which are based on computing various basis vectors. These algorithms are used for solving …