Mondriaan sparse matrix partitioning for attacking cryptosystems by a parallel block Lanczos algorithm: a case study

Authors:
Rob H. Bisseling;Ildikó Flesch
Affiliations:
Department of Mathematics, Utrecht University, Utrecht, The Netherlands;Department of Information and Knowledge Systems, Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands
Venue:
Parallel Computing - Algorithmic skeletons
Year:
2006

Citing 16
Cited 2

A bridging model for parallel computation

Communications of the ACM
Introduction to algorithms

Introduction to algorithms
The number field sieve

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm

Mathematics of Computation
Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Multilevel k-way hypergraph partitioning

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication

IEEE Transactions on Parallel and Distributed Systems
Basic Linear Algebra Subprograms for Fortran Usage

ACM Transactions on Mathematical Software (TOMS)
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Zoltan Data Management Service for Parallel Dynamic Applications

Computing in Science and Engineering
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference
Parallel Scientific Computation: A Structured Approach Using BSP and MPI

Parallel Scientific Computation: A Structured Approach Using BSP and MPI
Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies

SIAM Journal on Scientific Computing
A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication

SIAM Review
A block Lanczos algorithm for finding dependencies over GF(2)

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Parallel hypergraph partitioning for scientific computing

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing

Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices

Journal of Parallel and Distributed Computing
Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs

SIAM Journal on Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A case study is presented demonstrating the application of the Mondriaan package for sparse matrix partitioning to the field of cryptology. An important step in an integer factorisation attack on the RSA public-key cryptosystem is the solution of a large sparse linear system with 0/1 coefficients, which can be done by the block Lanczos algorithm proposed by Montgomery. We parallelise this algorithm using Mondriaan partitioning and discuss the high-level components needed. A speedup of 8 is obtained on 16 processors of a Silicon Graphics Origin 3800 for the factorisation of an integer with 82 decimal digits, and a speedup of 7 for 98 decimal digits.