Cryptanalysis of a Public Key Cryptosystem Based on the Matrix Combinatorial Problem
Volume 24, Issue 2 (2013), pp. 219–230
Pub. online: 1 January 2013
Type: Research Article
Received
1 March 2011
1 March 2011
Accepted
1 June 2012
1 June 2012
Published
1 January 2013
1 January 2013
Abstract
In this paper, we present a cryptanalysis of a public key cryptosystem based on the matrix combinatorial problem proposed by Wang and Hu (2010). Using lattice-based methods finding small integer solutions of modular linear equations, we recover the secret key of this cryptosystem for a certain range of parameters. In experiments, for the suggested parameters by Wang and Hu, the secret key can be recovered in seconds.