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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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_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
Zheltkov, D.A.: Effectivnie basovye operacii lineinoi algebry dlya reshenia bolshyh razrezennyh sistem nad konechnymi polyami. RuSCDays (2016, in Russian)
Dorofeev, A.: Reshenie sistem lineinyh uravnenii pri vichislenii logarifmov v konechnom prostom pole. Matematicheskie voprosy kriptographii 3(1), 5–51 (2012). (in Russian)
Popovyan, I., Nesterenko, Yu., Grechnikov, E.: Vychislitelno sloznye zadachi teorii chisel. MSU Publishing (2012, in Russian)
Zamarashkin, N.: Algoritmy dlya razrezennyh sistem lineinyh uravnenii v GF(2). MSU Publishing (2013, in Russian)
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)
Cuda C Programming guide. http://docs.nvidia.com/cuda/cuda-c-programming-guide
Acknowledgments
The work was supported by the RAS presidium program №1 “Fundamental Mathematics and its applications”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zamarashkin, N., Zheltkov, D. (2019). Block Lanczos-Montgomery Method over Large Prime Fields with GPU Accelerated Dense Operations. In: Voevodin, V., Sobolev, S. (eds) Supercomputing. RuSCDays 2018. Communications in Computer and Information Science, vol 965. Springer, Cham. https://doi.org/10.1007/978-3-030-05807-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-05807-4_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-05806-7
Online ISBN: 978-3-030-05807-4
eBook Packages: Computer ScienceComputer Science (R0)