Welcome to the resource topic for 2002/178
Attack on A New Public Key Cryptosystem from ISC’02 (LNCS 2433)
Authors: Fangguo Zhang, Shengli Liu, Kwangjo KimAbstract:
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.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .