Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000

Abstract. 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. Key words: public key cryptography, cryptanalysis, L3 -algorithm

• Type: Conference
• Year: 2001
• Where: ACISP
• Authors: Amr M. Youssef, Guang Gong
• Keywords: ACISP 2001, Public Key, Public Key Cryptography, Public Key Cryptosystem, Security Privacy