Solving low-density subset sum problems
Journal of the ACM (JACM)
Improved low-density subset sum algorithms
Computational Complexity
Hi-index | 0.00 |
Recently, Qu and Vanstone have announced the construction of several new public-key cryptosystems based on group factorization. One of these was described at the last AUSCRYPT meeting [2]. We point out a serious weakness of this last system which makes it insecure. Our method only uses elementary algebra.