|
do we got some homophonic substitution going here? could that explain the freq distribution? (i just got into cryptanalysis last night)
|
# ? Aug 19, 2016 17:45 |
|
|
# ? Jun 8, 2024 21:02 |
|
but i think that could possibly explain snap titty's very nice and helpful distribution chart, if the lower case letters were being used as homophones this was pretty cool: jumbo wales posted:The Beale ciphers are another example of a homophonic cipher. This is a story of buried treasure that was described in 1819–21 by use of a ciphered text that was keyed to the Declaration of Independence. Here each ciphertext character was represented by a number. The number was determined by taking the plaintext character and finding a word in the Declaration of Independence that started with that character and using the numerical position of that word in the Declaration of Independence as the encrypted form of that letter. Since many words in the Declaration of Independence start with the same letter, the encryption of that character could be any of the numbers associated with the words in the Declaration of Independence that start with that letter. Deciphering the encrypted text character X (which is a number) is as simple as looking up the Xth word of the Declaration of Independence and using the first letter of that word as the decrypted character.
|
# ? Aug 19, 2016 17:49 |
|
'2' & '3' are in the top four highest frequency bigrams, I'm thinking maybe 't' is a homophone for '9' or something I have no idea what I'm doingcode:
here's the alphabet or whatever code:
code:
|
# ? Aug 19, 2016 19:17 |
|
I got as far as trying to map bigrams and trigrams earlier this week before the poo poo hit the fan at work and I had to stop I don't really think that approach is going to (directly) bear fruit, the letter distributions show that it isn't a straight up substitution deffo gonna throw some effort at it this weekend burning swine fucked around with this message at 21:09 on Aug 19, 2016 |
# ? Aug 19, 2016 21:06 |
|
i am too dumb to do these but i am interested to see the outcomes
|
# ? Aug 19, 2016 23:13 |
|
Hello Yospos this is your computer.
|
# ? Aug 19, 2016 23:28 |
|
Squeezy Farm posted:Hello Yospos this is your computer. yospos is good
|
# ? Aug 19, 2016 23:43 |
|
yos
|
# ? Aug 19, 2016 23:57 |
|
spankmeister posted:yospos is good My operating system is a piece of poo poo but I still like it.
|
# ? Aug 20, 2016 06:47 |
|
Displeased Moo Cow posted:Some smart mother fuckers on the Internet
|
# ? Aug 20, 2016 12:10 |
|
I dot even have the faintest clue how to do anything like this at all
|
# ? Aug 21, 2016 20:50 |
|
echinopsis posted:I dot even have the faintest clue how to do anything like this at all I doubt you can decipher your own posting
|
# ? Aug 21, 2016 22:37 |
|
Bloody posted:i am too dumb to do these but i am interested to see the outcomes same. last time someone posted an jupiter notebook of them solving the puzzle and that was cool to read.
|
# ? Aug 22, 2016 00:47 |
|
anthonypants posted:YAMS YAMS YAMS YAMS YAMS YAMS YAMS YAMS YAMS YAMS YAMS YAMS YAMS YAMS YAMS someone post barry_bonds_yams.gif and i'll paypal you $20
|
# ? Aug 22, 2016 14:53 |
|
sooo since newlines are preserved and the overall frequency distribution doesn't make any kind of sense, i'm tinkering with the idea that the key rotates/changes every line. Problem is the first line is too short to do very much with, so I'm playing with 1. the last line 2. the longest line iunno still a shot in the dark though
|
# ? Aug 22, 2016 17:49 |
|
COACHS SPORT BAR posted:sooo since newlines are preserved and the overall frequency distribution doesn't make any kind of sense, i'm tinkering with the idea that the key rotates/changes every line. Problem is the first line is too short to do very much with, so I'm playing with newlines are preserved but they too are enciphered
|
# ? Aug 22, 2016 17:54 |
|
oh lol well nevermind that idea then
|
# ? Aug 22, 2016 17:57 |
|
OSI said there's padding used so.... Entire document is 3329 bytes which is a prime number so that might not be an accident. If we ignore the trailing newline because why not, 3328 has factors of 256, 128, 64 etc etc, so that's a thing, but I haven't been able to see any patterns when splitting it into blocks of those sizes. I'll going to mess around doing other stuff with the blocks but I'm probably up the wrong tree here
|
# ? Aug 22, 2016 19:41 |
|
It is safe to ignore the trailing newline
|
# ? Aug 22, 2016 20:05 |
|
hmmmm Hadn't thought about chunking the ciphertext, makes sense though. Possibly some CBC going on? I've been trying to find some kind of meaningful character/bigram frequency within subsets of the data, that could be a way to go I've been playing around with rotating keys some this morning (no longer on a "per line" basis), haven't gotten anywhere that way
|
# ? Aug 22, 2016 20:10 |
|
graph posted:barry_bonds_yams.gif
|
# ? Aug 22, 2016 23:06 |
|
the weird frequency distribution of the cipher text characters(as in the graphs posted on the first page) also holds if you only take every 2nd/3rd or the first or last half of the text. idk there could have been some differential thing going on. i also tried calculating the index of coincidence of the ciphertext and it's 1.7315 which is pretty much identical to english. i don't really know what this means, but combine it with the fact that cipher symbol frequency is very strongly dependent on symbol value and it seems to me like there's mostly a 1-to-1 substitution between plaintext and cipher symbols. maybe the reason there's no proper digraphs or tripgraphs is that it's just hella shuffled around?
|
# ? Aug 23, 2016 22:18 |
|
OSI be honest are you the crystalline guy? Is this crystalline?
|
# ? Aug 23, 2016 22:45 |
|
spankmeister posted:OSI be honest are you the crystalline guy? Is this crystalline?
|
# ? Aug 23, 2016 22:49 |
|
status: i've finished writing the ascii pipe spinner that will display while my computer solves this problem for me any second now
|
# ? Aug 23, 2016 23:10 |
|
COACHS SPORT BAR posted:status: i've finished writing the ascii pipe spinner that will display while my computer solves this problem for me doing the lords work
|
# ? Aug 23, 2016 23:11 |
|
spankmeister posted:OSI be honest are you the crystalline guy? Is this crystalline? i am not crazy enough to be him for those wondering wtf it is: https://crystalline.codeplex.com/
|
# ? Aug 24, 2016 00:09 |
|
has anyone solved yet? I'm late to the party but I've got a couple
|
# ? Aug 24, 2016 03:25 |
|
awia did on page 1, now the puzzle is figuring out how he did it
|
# ? Aug 24, 2016 04:02 |
|
NFX posted:i also tried calculating the index of coincidence of the ciphertext and it's 1.7315 which is pretty much identical to english. i don't really know what this means, but combine it with the fact that cipher symbol frequency is very strongly dependent on symbol value and it seems to me like there's mostly a 1-to-1 substitution between plaintext and cipher symbols. maybe the reason there's no proper digraphs or tripgraphs is that it's just hella shuffled around? edit: I don't think Awia actually solved it wyoak fucked around with this message at 16:08 on Aug 24, 2016 |
# ? Aug 24, 2016 16:04 |
|
wyoak posted:How large of an alphabet size did you use to get 1.73? letters (including j) (2 * 26), digits (10), all the symbols that appear, incl. newlines (9) = 71 i suppose if you include those characters then the value for English probably isnt 1.73 any more, but higher
|
# ? Aug 24, 2016 16:17 |
|
I got something like 1.7x too, using a rough estimate based on the alphabet size. Didn't make sense so I went in another direction.
|
# ? Aug 24, 2016 16:20 |
|
also my first take on alphabet size was 69 which seemed v. yospos I was disappointed when i recounted and got 70
|
# ? Aug 24, 2016 16:26 |
|
Anyone have links to the other challenges? One of them was a touchtone phone cipher but not sure what the other was. Ima get up in OSI's brain space
|
# ? Aug 24, 2016 16:33 |
|
don't have a link, but boffin v2 was rot-N where N is the length of the word iirc
|
# ? Aug 24, 2016 17:01 |
|
this was the second one: https://forums.somethingawful.com/showthread.php?threadid=3766370
|
# ? Aug 24, 2016 17:07 |
|
this was the first under the bletchley boffins name: https://forums.somethingawful.com/showthread.php?threadid=3708438 and this was the original challenge: https://forums.somethingawful.com/showthread.php?threadid=3704805
|
# ? Aug 24, 2016 17:10 |
|
problem I'm dealing with right now is figuring out what a meaningful frequency distribution looks like for text with uppercase, lowercase, numbers, and symbols. I've separated out cipherext that I have reason to believe maps to cleartext, but the abnormal nature of this alphabet is making frequency analysis difficult edit: this is a distribution I found while digging (based on text from the new york times), and I've come close but not quite matched it so far. Numbers in parens are % occurrence. code:
burning swine fucked around with this message at 17:58 on Aug 24, 2016 |
# ? Aug 24, 2016 17:56 |
|
if someone solves it and wants to post a sha256 sum of the output, feel free and i'll confirm that way too
|
# ? Aug 24, 2016 21:15 |
|
|
# ? Jun 8, 2024 21:02 |
|
i still want to believe that the lower case letters are homophones/synonyms for substitutions, that's why the distribution is so flat. i think if you take out the lower case letters, the distribution looks better, then the most common lower case letters are being homophoned for the least common upper case letters, which would flatten the distribution?
|
# ? Aug 24, 2016 21:21 |