Abstract
The Lu-Lee public key cryptosystem and Adiga-Shankar’s modification are considered to be insecure with cryptanalysis by integer linear programing, since only 2 or 3 unknown message blocks are used in the modular linear equation for encryption procedure. Unfortunately integer linear programming algorithms falls in trouble with more unknowns. In this paper we present a probabilistic algorithm for cryptanalysis of general Lu-Lee type systems with n message blocks. The new algorithm is base on lattice reduction and succeeds to break Lu-Lee type systems with up to 68 message blocks.
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
Lu, S.C., Lee, L.N.: A Simple and Effective Public-Key Cryptosystem. In: COMSAT Technical Review, vol. 9(1), pp. 16–23. Springer, Heidelberg (1979)
Adleman, L., Rivest, R.: How to break the Lu-Lee Public-Key Cryptosystem, MIT Laboratory for Computer Science Technical, July 24, 1-9 (1979)
Goethals, J.M., Couvreur, C.: A Cryptanalytic Attack on the Lu-Lee Public-Key Cryptosystem. Philips J. Res. 35, 301–306 (1980)
Kochanski, M.J.: Remarks on Lu and Lee’s Proposals. Cryptologia 4(4) (1980)
Adiga, B.S., Shankar, P.: Modified Lu-Lee Cryptosystem. Electronics Letters, 21(18), 794–795 (1985)
Duan, L.X., Nian, C.C.: Modified Lu-Lee Cryptosystem. Electronics Letters 25(13), 826 (1989)
Xing, L.D., Sheng, L.G.: Cryptanalysis of New Modified Lu-Lee Cryptosystems. Electronics Letters 26(3), 1601–1602 (1990)
Brickell, E.F., Odlyzko, A.M.: Cryptanalysis: A survey of recent results. Proceedings of the IEEE 76, 578–592 (1988)
Kannan, R.: Improved Algorithm for Integer Programming and Related Lattice Problems. In: Proc. 15th ACM Symposium on Theory of Computing, pp. 193–206 (1983)
Lenstra, A.K., Lenstra Jr., H.W., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 513–534 (1982)
Schnorr, C.P.: Fast LLL-type lattice reduction. Unpublished draft available at (October, 2004), http://www.mi.informatik.uni-frankfurt.de/research/papers.html
Nguyen, P.Q., Stehlé, D.: Floating-Point LLL Revisited. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215–233. Springer, Heidelberg (2005)
Nguyen, P.Q., Stehlé, D.: LLL on the Average. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 238–256. Springer, Heidelberg (2006)
Nguyen, P.Q., Stern, J.: The Two Faces of Lattices in Cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146–180. Springer, Heidelberg (2001)
Babai, L.: On Lov́asz lattice reduction and the nearest lattice point problem. Combinatorica 6, 1–13 (1986)
Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd STOC, pp. 601–610. ACM, New York (2001)
Shoup, V.: NTL. Number Theory C++ Library, http://www.shoup.net/ntl/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, H., Luo, P., Wang, D., Dai, Y. (2008). Cryptanalysis of General Lu-Lee Type Systems. In: Pei, D., Yung, M., Lin, D., Wu, C. (eds) Information Security and Cryptology. Inscrypt 2007. Lecture Notes in Computer Science, vol 4990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79499-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-79499-8_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79498-1
Online ISBN: 978-3-540-79499-8
eBook Packages: Computer ScienceComputer Science (R0)