The theory of generalized inverses of matrices over finite fields has been
proposed as a potential tool in cryptographic research for the past two yea
rs. Recently, Wu and Dawson proposed a public-key cryptosystem based on gen
eralized inverses of matrices. In this Letter, we show that the Wu-Dawson p
ublic-key cryptosystem can be broken by representing the ciphertext as a li
near combination of rows according to the public key.