This is a cipher I devised. It is really hard to crack because it is a polyalphabetic cipher. I don't want to explain that using words so I will explain what that means with an example. Lets imagine you wanted to encrypt the word "meet", you would get "ajyy" (given key of 5). Notice how in the encrypted version, the "jy" represents "ee". This is what polyalphabetic means, that letters don't always correspond with another letter. First, this cipher converts each letter of your message into a letter. For example, A=1,B=2etc. The algorithm then takes your key and multiplies each digit of pi by that number and does this "key" times. For example if your key was 3 then it would output 9,3,12,3,15 etc.... Then it adds the number for each letter as explained above to each term in the sequence generated above with pi. Some of these terms may be larger than 26 (# of letters) so, the program loops back around at 27 (i.e. 27=1). Look at an example with the key of 3. First, "pi trans" takes the first 3 digits of pi 314 and multiples each by 3 to get 9,3 and 12. Then you will be prompted for you message, in this case, Ben. Translate1 has the numerical equivalent of it. Then translate 2 is each term of translate 1 added to each term of pi trans. When there are more terms in translate1 than in pi trans (when message length is larger than key), it loops around pi trans. Translate 3 does the mod function. From translate3 to the final translation, it translates numbers to letters. Thats it!
I do not attribute this project to any one other than myself.
