Write a program that takes two lines of input and uses the first as a key phrase to encrypt the second according to the Playfair encryption technique., but to avoid any ambiguity, here's a brief summary:1. Program de vazut prin satelit in timp real. Generate a key table:Replace all occurrences of J in the key phrase with I, then strip all non-alphabet characters and repeated characters. Insert into a 5×5 encryption table, filling the remaining cells with the rest of the alphabet (except J; we don't like J).Example: S T A C KO V E R FStack Overflow - STACKOVERFLW - L W B D GH I M N PQ U X Y Z2. Prepare the message to be encryptedReplace every J with an I, strip all non-alphabet characters and split into pairs, using an X to break any pairs that contain the same letter twice.

1. Playfair Cipher Practice

If you end up with an odd number of letters, add X at the end. (Note: Numerals have to be spelt out in full — ONE, TWO, THREE, etc.

— but you can assume this has already been done for you.)Example: In:The cat crept into the crypt, crapped, and crept out again.Out:TH EC AT CR EP TI NT OT HE CR YP TC RA PX PE DA ND CR EP TO UT AG AI NX3. EncryptionEncrypt each pair of letters in turn. If they are in different rows and columns of the key table, replace each with the letter from the same row in the column where the other letter is found (e.g., VM⇒ EI, LZ⇒ GQ). If they are in the same row (or column), choose the two characters immediately to the right (or below), wrapping around if necessary (e.g., OE⇒ VR, ZG⇒ KP).Example: In:TH EC AT CR EP TI NT OT HE CR YP TC RA PX PE DA ND CR EP TO UT AG AI NXOut:SI RA CA RD FM VU IC VS MO RD ZN AK EC MZ MF BC YN RD FM SV TV KB TM MYThe string produced by this process is the encrypted message, which your program should output.

Playfair Cipher Practice

Rules:. The input text and key may be obtained from stdin, command line arguments or other such sources. Matlab - 458 chars function p=pf(k,p)k=upper(k),65:90;k(k74)=73;k(k90)=';,i=unique(k,'first');k=reshape(k(sort(i)),5,5);e=k,k(:,1);k(1,:);p=upper(p);p(p74)=73;p(p90)=';n=length(p);for i=1:2:nif i pf('Stack Overflow', 'The cat crept into the crypt, crapped, and crept out again.' )ans = SIRACARDFMVUICVSMORDZNAKECMZMFBCYNRDFMSVTVKBTMMYoctave:181 pf('This is a password!' ,'Programming Puzzles and Code Golf is a Stack Exchange site.' )ans = WDDEDSXIXOQFBTUYVQFISQWGRPFBWMESATAHHGMBVEITQFFISHMIoctave:182 pf('Matlab needs lambdas', 'Who thought elseif is good syntax?'

)ans = XGQMFQPKQDSACDKGRIFPQNILDMTW. Haskell - 711Demo: timwolla@/data/workspace/haskell/PCGghc pcg-23276.hs1 of 1 Compiling Main ( pcg-23276.hs, pcg-23276.o )Linking pcg-23276.timwolla@/data/workspace/haskell/PCG./pcg-23276 'Stack Overflow' 'The cat crept into the crypt, crapped, and crept out again.'

SIRACARDFMVUICVSMORDZNAKECMZMFBCYNRDFMSVTVKBTMMYCode: import Data.Listimport Data.Charimport Data.Maybeimport System.Environmentmain=do aif (length x)1 then x'X'else x)$s 2$concat$map(x-if (length x)1then x else intersperse 'X' x)$group$p (a!!1)p=map(x-if x'J' then 'I' else x).filter(isUpper).map toUpperk x=y(delete 'J'$'A'.' Z'y)where y=nub$p xu l m=(div i 5,mod i 5)where i=fromJust$elemIndex l$k mx y z a/=c&&b/=d=(e!!(a.5+d)):(e!!(c.5+b)): ac=(e!!(a.5+(mod(b+1)5))):(e!!(c.5+(mod(d+1)5))): True=(e!!((5.(mod(a+1)5))+b)):(e!!((5.(mod(c+1)5))+d)):whereo=u(z!!0)yt=u(z!!1)ya=fst ob=snd oc=fst td=snd te=k ys =s n l=(take n l):(s n(drop n l))Large version: import Data.Listimport Data.Charimport Data.MaybeencryptAll key text = map (encrypt key) (transformValue text)clean x = map (x - if x 'J' then 'I' else x) $ filter (isUpper) $ map (toUpper) xtransformKey x = y (delete 'J' $ 'A'.' Z' y)where y = nub (clean x)transformValue x = map (x - if (length x) 1 then x 'X' else x) $ split 2 $ concat $ map (x - if (length x) 1 then x else intersperse 'X' x) $ group $ clean xsearch letter key = (div index 5, mod index 5)where index = fromJust $ elemIndex letter $ transformKey keyencrypt key chars rowA /= rowB && colA /= colB = (key'!! (rowA.

5 + colB)): (key'!! (rowB. 5 + colA)): rowA rowB = (key'!! (rowA. 5 + ((colA + 1) `mod` 5))): (key'!! (rowB. 5 + ((colB + 1) `mod` 5))): otherwise = (key'!!

((5. ((rowA + 1) `mod` 5)) + colA)): (key'!! ((5. ((rowB + 1) `mod` 5)) + colB)): whererowA = fst $ search (head chars) keycolA = snd $ search (head chars) keyrowB = fst $ search (last chars) keycolB = snd $ search (last chars) keykey' = transformKey key-:: Int - a - asplit = split n l n 0 = (take n l): (split n (drop n l)) otherwise = error 'Negative n'. Pyth - 111Too late for competing, I just wanted to share.

Playfair-cipherVersion:0.1 nFunction:simple python code implemented Playfair cipher. Example:Encrypting:key:PlayfairExampleMessage:Hide the gold in the tree stumpBMODZBXDNABEKUDMUIXMMOUVIFDecrypting:Key:PlayfairExampleCipher:BMODZBXDNABEKUDMUIXMMOUVIF.