Abstract
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several load-balancing methods suited to these platforms. We have carried out process-level and thread-level parallel implementations under two different arithmetic libraries, and the best speedup obtained is 6.57 on eight cores. To the best of our knowledge, no implementation of the Lanczos algorithm on a multi-core platform is ever reported in the literature. Moreover, we seem to have achieved significantly larger speedup compared to all previously reported implementations of this algorithm.
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
Menezes, A.J., Vanstone, S.A., Oorschot, P.C.V.: Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton (1996)
Coppersmith, D., Odlyzko, A.M., Schroeppel, R.: Discrete logarithms in GF(p). Algorithmica 1(1), 1–15 (1986)
Odlyzko, A.M.: Discrete logarithms in finite fields and their cryptographic significance. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 224–314. Springer, Heidelberg (1985)
LaMacchia, B.A., Odlyzko, A.M.: Solving large sparse linear systems over finite fields. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 109–133. Springer, Heidelberg (1991)
Montgomery, P.L.: A block Lanczos algorithm for finding dependencies over GF(2). In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 106–120. Springer, Heidelberg (1995)
Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory 32, 54–62 (1986)
Penninga, O.: Finding column dependencies in sparse systems over F 2 by block Wiedemann. Master’s thesis, Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands (1998)
Dumas, J.G., Villard, G.: Computing the rank of large sparse matrices over finite fields. Computer Algebra in Scientific Computing CASC, Technische Universität München, Germany (2002)
Yang, L.T., Brent, R.P.: The parallel improved Lanczos method for integer factorization over finite fields for public key cryptosystems. In: ICPP Workshops, pp. 106–114 (2001)
Hwang, W., Kim, D.: Load balanced block Lanczos algorithm over GF(2) for factorization of large keys. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2006. LNCS, vol. 4297, pp. 375–386. Springer, Heidelberg (2006)
Page, D.: Parallel solution of sparse linear systems defined over GF(p). Technical Report CSTR-05-003, University of Bristol (2004)
OpenMP: The OpenMP API Specification for Parallel Programming, http://www.openmp.org/
Das, A., Veni Madhavan, C.E.: On the cubic sieve method for computing discrete logarithms over prime fields. International Journal of Computer Mathematics 82, 1481–1495 (2005)
Weber, D.: Computing discrete logarithms with the general number field sieve. In: Cohen, H. (ed.) ANTS 1996. LNCS, vol. 1122, pp. 337–361. Springer, Heidelberg (1996)
GNU: The GNU MP Bignum Library, http://gmplib.org/
Berger, E.D., McKinley, K.S., Blumofe, R.D., Wilson, P.R.: Hoard: A scalable memory allocator for multithreaded applications. In: ASPLOS, pp. 117–128 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacherjee, S., Das, A. (2010). Parallelization of the Lanczos Algorithm on Multi-core Platforms. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds) Distributed Computing and Networking. ICDCN 2010. Lecture Notes in Computer Science, vol 5935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11322-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-11322-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-11321-5
Online ISBN: 978-3-642-11322-2
eBook Packages: Computer ScienceComputer Science (R0)