Knapsack Based Public-Key Encryption: Suppose M=(m1, m2, ...,mn) is a binary message E(KM)=<K,M>=∑k;m; Decryption: Given: cipher text Z,N,Y,X Computing N-I mod Y D(=GREEDY(ZN- mod Y,X)11 Knapsack Based Public-Key • Encryption: Suppose M = (m1 , m2 ,…, mn ) is a binary message – E(K,M) = <K,M> =  ki mi • Decryption: Given: cipher text Z, N, Y, X – Computing N-1 mod Y – D(Z) = GREEDY(Z N-1 mod Y, X)