All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > General > Cryptography
PGKKW XIMAF TNEGA NFYGZ TMUIV (Posted on 2003-12-05) Difficulty: 5 of 5
WATAE TXLAL PDIBI MGTBU YBTMM FJBJW KBEIZ SGLZQ CCOCT XMQHM QSLFS
AOBFX QQRCK CJSME XFHLT GYSJN QEQUM FNPIZ ZMCWE PXQOD UIDLO SXLCV
CGIWI UIVYC HLYAE TKYKY RVOVZ FJWAR RCYCN SSJNN ADVZB BMQJQ UVGKC
UCPVN BGRZA EVOMF THBSK OZUYQ QDGUO FUIAT XOWPN QESJM MUHHU XBTMM
NYGYF YFNFH VIATB UOHPD QVJAT AEYLT MQTLE EXBTH MMYCT BDDAX
Determine what this cipher says, and the method of encryption, using the following hints:
  • It is not a simple substitution cipher.
  • Both the original plain text message and the encrypted message contain 270 characters (maybe with meaningless filler characters at the end).
  • Only one rather simple method of encryption has been used.
  • The encryption method is fairly robust. In other words, an error (while encrypting or decrypting) does not scramble the entire remaining message. Some very complicated ciphers have this problem.
  • In the encrypted text, M and T appear most often, and R appears least often (I do not think these facts help at all).
  • Both the original plain text and the encrypted message read from left to right.
  • You might be able to guess the full text after determining only the first three words.

See The Solution Submitted by DJ    
Rating: 4.1111 (9 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts hmm... | Comment 2 of 20 |
If there's 270 characters in both the code and the message, and it's not a simple substitution cipher, then exactly what is it?
  Posted by Tristan on 2003-12-05 18:25:35
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (5)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information