GPU Acceleration of Dense Matrix and Block Operations for Lanczos Method for Systems over Large Prime Finite Field
暂无分享,去创建一个
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 rectangular \(N \times K\) blocks with \(N \gg K;\)
multiplication of \(N \times K\) blocks by square \(K \times K\) matrices;
LU-decomposition of matrices.
[1] Shi Bai,et al. Factorisation of RSA-704 with CADO-NFS , 2012, IACR Cryptol. ePrint Arch..
[2] D. Zheltkov,et al. Block Lanczos–Montgomery Method with Reduced Data Exchanges , 2016 .
[3] Arjen K. Lenstra,et al. Factorization of a 768-Bit RSA Modulus , 2010, CRYPTO.
[4] Jack J. Dongarra,et al. An Improved Magma Gemm For Fermi Graphics Processing Units , 2010, Int. J. High Perform. Comput. Appl..