Abstract
Researchers use NFS (Number Field Sieve) method with Lanczos algorithm to analyze big-sized RSA keys. NFS method includes the integer factorization process and nullspace computation of huge sparse matrices. Parallel processing is indispensible since sequential computation requires weeks (even months) of CPU time with supercomputers even for 150-digit RSA keys. This paper presents details of improved block Lanczos algorithm based on previous implementation[4,10]. It includes a new load balancing scheme by partitioning the matrix such that the numbers of nonzero components in the submatrices become equal. Experimentally, a speedup up to 6 and the maximum of efficiency of 0.74 have been achieved using an 8-node cluster with Myrinet interconnection.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cavallar, S., Dodson, B., Lenstra, A.K., Leyland, P., Lioen, W., Montgomery, P.L., Murphy, B., te Riele, H., Zimmermann, P.: Factorization of RSA-140 Using the Number Field Sieve. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 195–207. Springer, Heidelberg (1999)
Cavallar, S., Dodson, B., Lenstra, A.K., Lioen, W.M., Montgomery, P.L., Murphy, B., te Riele, H., Aardal, K., Gilchrist, J., Guillerm, G., Leyland, P.C., Marchand, J., Morain, F., Muffett, A., Putnam, C., Zimmermann, P.: Factorization of a 512-bit RSA Modulus. Theory and Application of Cryptographic Techniques, 1–18 (2000)
Cullum, J.K., Willoughby, R.A.: Lanczos Algorithms for Large Symmetric Eigenvalue Computations,Theory, Birkhauser, Boston, Basel, Stuttgart, vol. I (1985)
Flesch, I., Bisseling, R.H.: A New Parallel Approach to the Block Lanczos Algorithm for Finding Nullspaces over GF(2). Master’s thesis, Department of Mathematics, Utrecht University, Utrecht, the Netherlands (November 2002)
Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)
Hwang, W.: Improved Parallel Block Lanczos Algorithm over GF(2) by Load Balancing, Master Thesis, Korea University (December 2005)
Lanczos, C.: An Iteration Method for the Solution of the Eigenvalue Problem of Linear Differential and Integral Operators. Journal of Research of the National Bureau of Standards 45(4), 255–282 (1950)
Lenstra, A., Lenstra, H.J., Manasse, M., Pollard, J.: The number field sieve. In: 22nd Annual ACM Symposium on the Theory of Computation, pp. 564–572 (1990)
Montgomery, P.L.: Square roots of products of algebraic numbers. In: Gautschi, W. (ed.) Mathematics of Computation 1943-1993: a Half-Century of Computational Mathematics. Proceedings of Symposia in Applied Mathematics, May 1994, pp. 567–571. American Mathematical Society (1994)
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)
Kim, D., Kim, D.: Fast Broadcast by the Divide-and-Conquer Algorithm. In: 2004 IEEE International Conference on Cluster Computing, San Diego, USA, pp. 487–488 (September 2004)
KISTI Supercomputing Cener: http://www.ksc.re.kr
MPI: A Message-Passing Interface Standard: MPI Forum (1995)
MPICH - A portable implementation of MPI, http://www.mcs.anl.gov/mpi/mpich
Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Comm. ACM 21, 120–126 (1976)
RSA Laboratories: RSA Security (December 2005), Home page : http://www.rsasecurity.com
RSA Laboratory: Security Estimates for 512-bit RSA, RSA Data Security Inc.
RSA Lab.: (1995), http://www.rsasecurity.com/rsalabs/challenges/factoring/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hwang, W., Kim, D. (2006). Load Balanced Block Lanczos Algorithm over GF(2) for Factorization of Large Keys. In: Robert, Y., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing - HiPC 2006. HiPC 2006. Lecture Notes in Computer Science, vol 4297. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11945918_38
Download citation
DOI: https://doi.org/10.1007/11945918_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68039-0
Online ISBN: 978-3-540-68040-6
eBook Packages: Computer ScienceComputer Science (R0)