Abstract
Many algorithms from Number Theory and their implementation in software are of high practical importance, since they are the building primitives of many protocols for data encryption and authentication of Internet connections. Number theory algorithms are also the basic part of cryptanalytic procedures. Many of these algorithms can be parallelized in a natural way. In this paper we describe our efforts to develop a software package that implements various Number Theory algorithms on GPU clusters and in partial our implementations of integer factorization using NVIDIA CUDA on clusters equipped with NVIDIA GPUs. Also we report results of our experiments regarding the performance of our implementation.
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
Preview
Unable to display preview. Download preview PDF.
References
Bernstein, D., Lang, T.: Explicite formulas database, http://hyperelliptic.org/EFD
Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: ECM using Edwards curves (2008), http://eprint.iacr.org/2008/016
Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 29–50. Springer, Heidelberg (2007)
Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389–405. Springer, Heidelberg (2008)
Bernstein, D.J., Chen, T.-R., Cheng, C.-M., Lange, T., Yang, B.-Y.: ECM on Graphics Cards, http://eprint.iacr.org/2008/480
Bernstein, D.J., Chen, H.-C., Cheng, C.-M., Lange, T., Niederhagen, R., Schwabe, P., Yang, B.-Y.: ECC2K-130 on NVIDIA GPUs, http://eprint.iacr.org/2012/002
CUDA 4 Programming Guide, http://developer.download.nvidia.com/compute/DevZone/docs/html/C/doc/CUDA_C_Programming_Guide.pdf
Dongarra, J., et al. (eds.): Sourcebook of Parallel Computing. The Morgan Kaufmann Series in Computer Architecture and Design. Morgan Kaufmann Publisher, Elsevier Science (2003)
Edwards, H.M.: A normal form for elliptic curves. Bulletin of the American Mathematical Society 44, 393–422 (2007), http://www.ams.org/bull/2007-44-03/S0273-0979-07-01153-6/home.html
Lenstra Jr., H.W.: Factoring integers with elliptic curves. Annals of Mathematics 126, 649–673 (1987)
Montgomery, P.L.: Speeding the Polard and elliptic curve methods of factorization. Mathematics of Computation 48, 243–264 (1987)
MPI-2 Standard, http://www.mpi-forum.org/docs/mpi-2.2/mpi22-report.pdf
Szerwinski, R., Güneysu, T.: Exploiting the Power of GPUs for Asymmetric Cryptography. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 79–99. Springer, Heidelberg (2008)
Zimmermann, P., Dodson, B.: 20 Years of ECM. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 525–542. Springer, Heidelberg (2006)
Zimmermann, P., et al., https://scm.gforge.inria.fr/svn/ecm/trunk/gpu/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Atanassov, E., Georgiev, D., Manev, N. (2014). Number Theory Algorithms on GPU Clusters. In: Dulea, M., Karaivanova, A., Oulas, A., Liabotis, I., Stojiljkovic, D., Prnjat, O. (eds) High-Performance Computing Infrastructure for South East Europe's Research Communities. Modeling and Optimization in Science and Technologies, vol 2. Springer, Cham. https://doi.org/10.1007/978-3-319-01520-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-01520-0_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01519-4
Online ISBN: 978-3-319-01520-0
eBook Packages: EngineeringEngineering (R0)