Paper 2002/178 Original: eprint.iacr.org/2002/178 ↗
Attack on A New Public Key Cryptosystem from ISC'02 (LNCS 2433)
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2002-11-21: last updated
- 2002-11-21: published
- Short URL
- https://ia.cr/2002/178
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2002/178,
author = {Fangguo Zhang and Shengli Liu and Kwangjo Kim},
title = {Attack on A New Public Key Cryptosystem from ISC'02 (LNCS 2433)},
howpublished = {Cryptology {ePrint} Archive, Paper 2002/178},
year = {2002},
url = {https://eprint.iacr.org/2002/178}
}