Linear algebra and extended mappings generalise public key cryptographic knapsack algorithms
- 12 May 1983
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 19 (10) , 379-381
- https://doi.org/10.1049/el:19830262
Abstract
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.Keywords
This publication has 1 reference indexed in Scilit:
- A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982