Skip to main content
Springer Nature Link
Log in

Parallelization of the Lanczos Algorithm on Multi-core Platforms

  • Conference paper
Distributed Computing and Networking (ICDCN 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5935))

Included in the following conference series:

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

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Menezes, A.J., Vanstone, S.A., Oorschot, P.C.V.: Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton (1996)

    Book  Google Scholar 

  2. Coppersmith, D., Odlyzko, A.M., Schroeppel, R.: Discrete logarithms in GF(p). Algorithmica 1(1), 1–15 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. 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)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Wiedemann, D.H.: Solving sparse linear equations over finite fields. IEEE Transactions on Information Theory 32, 54–62 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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)

    Google Scholar 

  8. 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)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Chapter  Google Scholar 

  11. Page, D.: Parallel solution of sparse linear systems defined over GF(p). Technical Report CSTR-05-003, University of Bristol (2004)

    Google Scholar 

  12. OpenMP: The OpenMP API Specification for Parallel Programming, http://www.openmp.org/

  13. 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)

    Article  MathSciNet  MATH  Google Scholar 

  14. 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)

    Google Scholar 

  15. GNU: The GNU MP Bignum Library, http://gmplib.org/

  16. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Indian Institute of Technology, Kharagpur, India, 721302

    Souvik Bhattacherjee & Abhijit Das

Authors
  1. Souvik Bhattacherjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abhijit Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Science Foundation, 4201 Wilson Blvd, Arlington, 22130, VA, USA

    Krishna Kant

  2. Department of Computer Science, The University of Iowa, 52242-1419, Iowa City, IA, USA

    Sriram V. Pemmaraju

  3. Department of Computer Science and Engineering, Madras, Indian Institute of Technology (IIT), 600036, Chennai, India

    Krishna M. Sivalingam

  4. Department of Computer and Information Science, Temple University, 119122, Philadelphia, PA, USA

    Jie Wu

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics