International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Attack on A New Public Key Cryptosystem from ISC'02 (LNCS 2433)

Authors:
Fangguo Zhang
Shengli Liu
Kwangjo Kim
Download:
URL: http://eprint.iacr.org/2002/178
Search ePrint
Search Google
Abstract: In ISC 2002, J. Zheng proposed a new public key cryptosystem whose security is based upon the algebraic problem of reducing a high degree matrix to its canonical form by similarity transformations. In this paper, we show that factoring a polynomial over a finite field can be used to break down Zheng's public key cryptosystem. The complexity of our attack is polynomial time. In other word, the underlying problem of Zheng's public key cryptosystem is not a ``hard'' problem.
BibTeX
@misc{eprint-2002-11701,
  title={Attack on A New Public Key Cryptosystem from ISC'02 (LNCS 2433)},
  booktitle={IACR Eprint archive},
  keywords={Public key cryptography, Attack, Polynomial,Matrix, Finite field},
  url={http://eprint.iacr.org/2002/178},
  note={ zhfg@icu.ac.kr 12012 received 20 Nov 2002},
  author={Fangguo Zhang and Shengli Liu and Kwangjo Kim},
  year=2002
}