Low-density attack revisited

Authors:
Tetsuya Izu;Jun Kogure;Takeshi Koshiba;Takeshi Shimoyama
Affiliations:
Fujitsu Laboratories Ltd., Nakahara-ku, Japan 211-8588;Fujitsu Laboratories Ltd., Nakahara-ku, Japan 211-8588;Department of Information and Computer Sciences, Saitama University, Sakura, Japan 338-8570;Fujitsu Laboratories Ltd., Nakahara-ku, Japan 211-8588
Venue:
Designs, Codes and Cryptography
Year:
2007

Citing 6
Cited 3

Solving low-density subset sum problems

Journal of the ACM (JACM)
Breaking iterated knapsacks

Proceedings of CRYPTO 84 on Advances in cryptology
Improved low-density subset sum algorithms

Computational Complexity
Lattice basis reduction: improved practical algorithms and solving subset sum problems

Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Attacking the Chor-Rivest cryptosystem by improved lattice reduction

EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques

Analysis of the efficiency of the Chor-Rivest cryptosystem implementation in a safe-parameter range

Information Sciences: an International Journal
Quadratic compact knapsack public-key cryptosystem

Computers & Mathematics with Applications
New definition of density on knapsack cryptosystems

AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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