ThekeywordforthelastcipherwaspiThetechniqueusedinthiscipherisaCaesarsquareItsprobablyabitobvioushavingasquarenumberofcharactersinthemessageThenextonemightwellbeacombinationofthetechniquesusedsofar
Solved by noting that the length was 196 = 14^2, using the following Mathematica code:
Partition[Characters[string], 14] // Transpose // StringJoin
I've got a solution for Semicircle, as well (the key being, appropriately, PI):
IF YOU CAN READ THIS, WELL DONE! THIS SORT OF CIPHER IS CALLED A POLYALPHABETIC CIPHER. FOR EXAMPLES LIKE THIS ONE WITH A KEYWORD OF LENGTH TWO, IT'S POSSIBLE TO SOLVE IT BY HAND JUST TRYING POSSIBILITIES. HOWEVER, WITH A LONGER KEYWORD THIS GETS VERY HARD. THERE ARE MORE SOPHISTICATED TECHNIQUES, ONE OF WHICH IS CALLED KASISKI EXAMINATION. THIS INVOLVES LOOKING FOR REPEATED LETTERS IN THE CIPHERTEXT. IT'S LIKELY THAT THE NUMBER OF LETTERS INBETWEEN THESE REPEATS IS A MULTIPLE OF THE KEYWORD LENGTH. LOOK AT WIKIPEDIA FOR MORE INFORMATION! BY THE WAY, IF YOU DIDN'T WORK IT OUT, THE PREVIOUS CIPHER WAS A KEYWORD SUBSTITUTION CIPHER WITH KEYWORD KEYWORD. SO FAR, WE'VE ONLY CONSIDERED SUBSTITUTION CIPHERS, BUT THERE ARE OTHER ALTERNATIVES. WE COULD FOR EXAMPLE REORDER THE CIPHERTEXT.