Advertisement

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

  • Nikolai ZamarashkinEmail author
  • Dmitry Zheltkov
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 965)

Abstract

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 methods to solve such problems. Main parallel resource of the method us the size of the block. But computational cost of dense matrix operations is increasing with block size growth. Thus, parallel scaling is close to linear only while complexity of such operations are relatively small. In this paper block Lanczos-Montgomery method with dense matrix operations accelerated on GPU is implemented. Scalability tests are performed (including tests with multiple GPU per node) and compared to CPU only version.

Keywords

Linear systems over prime fields Parallel computations GPGPU 

Notes

Acknowledgments

The work was supported by the RAS presidium program №1 “Fundamental Mathematics and its applications”.

References

  1. 1.
    Zamarashkin, N., Zheltkov, D.: Block Lanczos-Montgomery method with reduced data exchanges. In: Voevodin, V., Sobolev, S. (eds.) RuSCDays 2016. CCIS, vol. 687, pp. 15–26. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-55669-7_2CrossRefGoogle Scholar
  2. 2.
    Zamarashkin, N., Zheltkov, D.: GPU acceleration of dense matrix and block operations for Lanczos Method for systems over large prime finite field. In: Voevodin, V., Sobolev, S. (eds.) RuSCDays 2017. CCIS, vol. 793, pp. 14–26. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-71255-0_2
  3. 3.
    Zheltkov, D.A.: Effectivnie basovye operacii lineinoi algebry dlya reshenia bolshyh razrezennyh sistem nad konechnymi polyami. RuSCDays (2016, in Russian)Google Scholar
  4. 4.
    Dorofeev, A.: Reshenie sistem lineinyh uravnenii pri vichislenii logarifmov v konechnom prostom pole. Matematicheskie voprosy kriptographii 3(1), 5–51 (2012). (in Russian)CrossRefGoogle Scholar
  5. 5.
    Popovyan, I., Nesterenko, Yu., Grechnikov, E.: Vychislitelno sloznye zadachi teorii chisel. MSU Publishing (2012, in Russian)Google Scholar
  6. 6.
    Zamarashkin, N.: Algoritmy dlya razrezennyh sistem lineinyh uravnenii v GF(2). MSU Publishing (2013, in Russian)Google Scholar
  7. 7.
    Nath, R., Tomov, S., Dongarra, J.: An improved MAGMA GEMM for Fermi graphics processing units. Int. J. High Perform. Comput. Appl. 24(4), 511–515 (2010)CrossRefGoogle Scholar
  8. 8.

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.INM RASMoscowRussia

Personalised recommendations