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 L 3-lattice reduction algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai and C. Dwork, A public key cryptosystem with worst-case/average case equivalence, Proc. of the twenty ninth annual ACM symposium on theory of computing, pp. 284–293, 1997.
O. Goldreich, S. Goldwasser and S. Halevi, Public key crypto systems from lattice reduction problems, Advances in Cryptology, Pro. of CRYPTO’ 97, Springer-Verlag, LNCS 1294, pp. 112–131.
G. H. Hardy and E. M. Wright, An introduction to the theory of numbers, 5th edition, Oxford University Press, 1979.
A J. Menezes, P. C. van Oorschot and S A. Vanstone, Handbook of Applied Cryptographic Research, CRC Press, 1996.
P. Nguyen and J. Stern, Lattice reduction in cryptology: An update, Algorithmic Number Theory, Proc. of ANTS-IV, Springer-Verlag, LNCS 1838.
P. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto’ 97, Advances in Cryptology, Pro. of CRYPTO’99, Springer-Verlag, LNCS 1666, pp. 288–304.
P. Nguyen and J. Stern, Cryptanalysis of the Ajtai-Dwork Cryptosystem, Advances in Cryptology, Pro. of CRYPTO’ 98, Springer-Verlag, LNCS 1462, pp. 223–242.
P. Nguyen, J. Stern: Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC’ 97. Selected Areas in Cryptography 1998, Springer-Verlag, LNCS 1556, pp. 213–218.
P. Nguyen and I. Shparlinkski, Private communications, Jan 24, 2001.
Pate Williams, Algorithms from Handbook of Applied Cryptography, C code available at http://www.mindspring.com/~pate/crypto/chap03.html.
H. Yoo, S. Hong, S. Lee, O. Yi and M. Sung, A Proposal of a New Public Key Cryptosystem using Matrices Over a Ring, Fifth Australian Conference on Information Security and Privacy (ACISP 2000), Springer-Verlag, LNCS 1841, 2000, pp. 41–48.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Youssef, A., Gong, G. (2001). Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000. In: Varadharajan, V., Mu, Y. (eds) Information Security and Privacy. ACISP 2001. Lecture Notes in Computer Science, vol 2119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47719-5_3
Download citation
DOI: https://doi.org/10.1007/3-540-47719-5_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42300-3
Online ISBN: 978-3-540-47719-8
eBook Packages: Springer Book Archive