At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA problem. In this paper we present a heuristic attack that enables us to recover the private key from the public key. In particular, we show that breaking the system can be reduced to finding a short vector in a lattice which can be achieved using the L3-lattice reduction algorithm.
CITATION STYLE
Youssef, A., & Gong, G. (2001). Cryptanalysis of a public key cryptosystem proposed at ACISP 2000. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2119, pp. 15–20). Springer Verlag. https://doi.org/10.1007/3-540-47719-5_3
Mendeley helps you to discover research relevant for your work.