1. Encrypt this binary string into cipher text: 110000. Include in your answer the formula the decoder would use to decrypt your cipher text in the format (coded answer) x N mod (m) = Y

2. Decrypt this cipher text into a binary string: 106

For fun, consider trying other codes or other combinations of "weights" (as long as they stay superincreasing!), multipliers, and modulates. While this form of encryption is relatively weak, it shows you how the general process works. For a knapsack code to be reasonably secure, it would need well over 200 terms each of length 200 bits!​