Low-Density Attack Revisited

  title={Low-Density Attack Revisited},
  author={Tetsuya Izu and Jun Kogure and Takeshi Koshiba and Takeshi Shimoyama},
  journal={IACR Cryptology ePrint Archive},
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost all the problems of density < 0.9408... in the asymptotical sense. On the other hand, the subset sum problem itself is known as an NP-hard problem, and a lot of efforts have been paid to establish public-key cryptosystems based on the problem. In these cryptosystems, densities of the subset sum problems should be higher… CONTINUE READING
8 Citations
16 References
Similar Papers

Similar Papers

Loading similar papers…