Cryptanalysis of General Lu-Lee Type Systems

Authors:
Haijian Zhou;Ping Luo;Daoshun Wang;Yiqi Dai
Affiliations:
Tsinghua National Laboratory for Information Science and Technology (TNlist) Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084;Tsinghua National Laboratory for Information Science and Technology (TNlist) Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084;Tsinghua National Laboratory for Information Science and Technology (TNlist) Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084;Tsinghua National Laboratory for Information Science and Technology (TNlist) Department of Computer Science and Technology, Tsinghua University, Beijing, China 100084
Venue:
Information Security and Cryptology
Year:
2007

Citing 7
Cited 0

On Lova´sz' lattice reduction and the nearest lattice point problem

Combinatorica
A sieve algorithm for the shortest lattice vector problem

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The Two Faces of Lattices in Cryptology

CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Improved algorithms for integer programming and related lattice problems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Fast LLL-type lattice reduction

Information and Computation
LLL on the average

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory
Floating-Point LLL revisited

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

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 nmessage blocks. The new algorithm is base on lattice reduction and succeeds to break Lu-Lee type systems with up to 68 message blocks.