Cryptanalysis of a Public-key Cryptosystem Using Lattice Basis Reduction Algorithm
In this manuscript, we proposed a new attack against Hwang et al.s cryptosystem. This cryptosystem uses a super-increasing sequence as private key and the authors investigate a new
algorithm called permutation combination algorithm to enhance
density of knapsack to avoid the low-density attack. Sattar J. Aboud [Aboud j. Sattar, “An improved knapsack public key cryptography system”, International Journal of Internet
Technology and Secured Transactions, Vol.3 (3), pp.310-319,2011] used Shamirs attack on the basic Merkle-Hellman cryptosystem to break this cryptosystem. Due to use of
Lensteras integer programming, Lagarias showed that Shamirs
attack is inefficient in practice; So, Abouds attack is impractical
too.
Keywords: Knapsack-type cryptosystem, LLL-lattice basis reduction algorithm, simultaneous Diophantine approximation, Cryptanalysis
Download Full-Text
ABOUT THE AUTHORS
Roohallah Rastaghi
Department of Electrical Engineering, Aeronautical University of Since and Technology, Tehran, Iran
Hamid R. Dalili Oskouei
Department of Electrical Engineering, Aeronautical University of Since and Technology, Tehran, Iran
Roohallah Rastaghi
Department of Electrical Engineering, Aeronautical University of Since and Technology, Tehran, Iran
Hamid R. Dalili Oskouei
Department of Electrical Engineering, Aeronautical University of Since and Technology, Tehran, Iran
