A way to attack public-key cryptosystems based on the knapsack problem is proposed. The basic idea of the approach described is to find pairs of natural numbers, namely values for a modulus m and a multiplier w, which reduce the knapsack elements simultaneously by modular multiplication. The ratio r=w/m plays an overriding role.