Linear algebra and extended mappings generalise public key cryptographic Knapsack algorithms

The original Merkle-Hellman knapsack algorithm is the most practical of the public key algorithms, but is considered insecure. Improvements have been proposed. In the letter the improvements are unified and extended using linear algebra and extended mappings.