All Sound Same

Post Reply
lukas
Posts: 34
Joined: Wed Nov 26, 2008 1:53 pm
Location: Germany

All Sound Same

Post by lukas »

Dear gfoot can you give any hint what to do to solve this challenge :?:
gfoot
Posts: 269
Joined: Wed Sep 05, 2007 11:34 pm
Location: Brighton, UK

Post by gfoot »

I knew it was kind of hard, but I'm surprised nobody has solved it yet. This one was actually just a warm-up - I sent adum a much more complex one too! I thought tails would solve this simple one within 24 hours or something. Maybe he just hasn't seen it yet... :)

It's an old-fashioned technique, and not very sophisticated, but its cryptanalysis method doesn't show up much either on Google or in the only book I own on cryptography. As such, I think you'll need to roll your own algorithms for solving it.
tails
Posts: 191
Joined: Tue Jun 10, 2008 7:51 pm
Location: Tokyo

Post by tails »

Thank you for your expectation, but I have already spent several hours for this challenge. Hmmm... I'll try harder.
fridolin
Posts: 16
Joined: Sun Nov 30, 2008 9:15 am

Post by fridolin »

I think i got the type of chipher (as always: just consider the caption) - but the cryptanalysis is really hard.
rmplpmpl
Posts: 113
Joined: Sun Oct 26, 2008 10:38 am
Location: Germany

Post by rmplpmpl »

the same for me, if it is what it seems to be, then every approach to break the code failed so far.
gfoot
Posts: 269
Joined: Wed Sep 05, 2007 11:34 pm
Location: Brighton, UK

Post by gfoot »

It is hard, much harder than I thought. I wrote an analysis tool to see exactly how hard it was going to be, but it looks like I underestimated. The key is to look at relationships rather than individual values.

adum asked me to post an easier example, but I forgot - I'll send it soon though. It might help you work out how your analysis should work.
MagneticMonopole
Posts: 26
Joined: Fri Nov 07, 2008 3:19 pm

Can no longer access challenge

Post by MagneticMonopole »

Well, I solved the challenge some days ago (and answered the question correctly). Now the challenge is gone, at least from my perspective. Accessing the challenge url directly tells my that I am not ready for this challenge. What happened?
gfoot
Posts: 269
Joined: Wed Sep 05, 2007 11:34 pm
Location: Brighton, UK

Post by gfoot »

There's a warm-up challenge before it now, which you need to solve before the other will appear again.
User avatar
laz0r
Posts: 290
Joined: Thu Feb 04, 2010 4:18 pm
Location: Within the depths of Unix

Post by laz0r »

Well I decrypted it but I can't answer the question! The number 43 is not used in the text - is that spoiling my key input?

EDIT - got it, see the rest of this post for a clue! :)
There is no spoon.
User avatar
Hippo
Posts: 339
Joined: Sat Feb 01, 2014 12:05 am
Location: Praha 5

Post by Hippo »

What form should the answer have? Is it like in warmup?
Or there should be english text after deciphering?

Thanks
User avatar
Hippo
Posts: 339
Joined: Sat Feb 01, 2014 12:05 am
Location: Praha 5

Post by Hippo »

Damn, I have hoped there is thread for solvers there ...

[edit] ... moved there [/edit]
Last edited by Hippo on Tue Apr 12, 2016 11:59 pm, edited 1 time in total.
eulerscheZahl
Posts: 58
Joined: Thu Nov 29, 2012 7:45 pm
Location: Germany

Post by eulerscheZahl »

I only searched for different numbers, that represent the same letter with my code (by calculating some kind of square difference).
Then it was only a matter of guessing and frequency analysis. [sentence removed]

And I have no idea, what you did here :shock:
Last edited by eulerscheZahl on Mon Apr 11, 2016 2:46 pm, edited 1 time in total.
User avatar
Hippo
Posts: 339
Joined: Sat Feb 01, 2014 12:05 am
Location: Praha 5

Post by Hippo »

Hmmm I have not spoiled the question of presented alphabet ...

The beam search is basically maintaining the best "window" solutions according to evaluation of partially filled plaintext (corresponding to partial keys). Only keys in the window are extended for the next generation. ... So you should have evaluator of partial plain texts "language model".
Good ordering of where to extend the keys helps. (For example first cipher letter 01, next cipher letter 07 ...)

You hope to have language model which evaluates best the plain text corresponding to original plain text.
And you hope all the generations of partial plaintexts corresponding to the key extesions would fit to the corresponding window.
Last edited by Hippo on Wed Apr 13, 2016 12:00 am, edited 1 time in total.
User avatar
Hippo
Posts: 339
Joined: Sat Feb 01, 2014 12:05 am
Location: Praha 5

Post by Hippo »

Moved to solved section ...
Last edited by Hippo on Wed Apr 13, 2016 12:02 am, edited 2 times in total.
AMindForeverVoyaging
Forum Admin
Posts: 496
Joined: Sat May 28, 2011 9:14 am
Location: Germany

Post by AMindForeverVoyaging »

Hippo wrote:Damn, I have hoped there is thread for solvers there ...
There are threads for both challenges in the "Challenges Solved" section.

Sounds Same Warmup: http://www.hacker.org/forum/viewtopic.php?t=1280
All Sound Same: http://www.hacker.org/forum/viewtopic.php?t=1261
Post Reply