Knapsack Based Public-Key Encryption: Suppose M=(ml, m2, .,mn) is a binary message E(KM)=<KM>=∑k;m Decryption: Given: cipher textZ,N,Y,X Computing n-modY D(2= 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)