A more efficient public-key cryptosystem using the Pascal triangle

The authors propose a public-key cryptosystem that uses a knapsack model based on the structure of a Pascal triangle or a super-Pascal triangle as defined herein. Most knapsack cryptosystems are based on superincreasing knapsack sets and are low density. Such low-density sets have been effectively cryptoanalyzed by the methods of Lagarias and Odlyzko (1985) and Brickell (1983). The current cryptosystem does not seem vulnerable to such attacks. Furthermore, the computational cost of this method compares very favorably with the cost of the familiar Rivest-Shamir-Adelman (1978) public-key cryptosystem. The weakness of the system is its substantial storage cost