Introduction - If you have any usage issues, please Google them yourself
The encryption algorithm using Merkle-Hellman
knapsacks starts with a binary message.
* The message is envisioned as a binary sequence P =
[p1, p2, … ,pk].
* Divide the message into blocks of m bits, Po = [P1, P2,
... ,Pm], P1 = [Pm+1, ... ,P2m], and so
*forth. The value of m is the number of terms in the
simple or hard knapsack