Cryptanalysis of general Lu-Lee type systems

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhou, H., Luo, P., Wang, D., & Dai, Y. (2008). Cryptanalysis of general Lu-Lee type systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4990 LNCS, pp. 412–426). https://doi.org/10.1007/978-3-540-79499-8_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free