hacker.org

Hi, I just solved this challenge:-) You should ignore the last egg, to solve it. And yes, there are some more special characters in the plaintext, which cannot be found in the pre-warmup challenge. BTW: The next 'Didactic Scrambled Egg Cipher' challenge doesn't show the full code of the encryption a...

Hi, I wonder, if this challenge is somehow broken. My program for this challenge can solve the pre-warmup challenge, even with a 16 byte key in less than a second. But for this challenge, my program doesn't find a valid solution. I have only one explanation: Are there some special characters in the ...

Hi, I've tried to compile the bitbath sources. I've done the following: $ git-clone git://github.com/adum/bitbath.git src $ cd src/Engine $ mkdir bin # Otherwise ant will fail $ ant [ ant output omitted / build was successfull ] $ cd ../hackjvm $ ant [ ant output omitted / build was successfull ] $ ...

It is a long time ago, but it was much more straight forward than a substitution cipher. I've observed, that every cleartext character is encoded in 3 characters. And there are three different characters, so that there are 3*3*3=27 possible combinations. Therefore I mapped m, p and f to 0, 1 and 2, ...

Yes, I've seen the second image. I wrote a bash script, and used 'xxd -r' to convert the output. #!/bin/bash a=0 k=0 for i in manyfiles/*/*/*/*/* ; do s=`ls -al $i | cut -d" " -f5` if [ $k -eq 0 ] ; then printf "%06x:" $a fi printf " %02x" $s k=$((k+1)) a=$((a+1)) if [ ...

Hello,

I didn't write any converter. I simply used convert (part of ImageMagick) to convert the file into raw format:

Today, I've installed Windows 7 Beta in a VirtualBox in order to solve this challenge.

I'm glad, I finally solved it. This looks like an easy challenge, but the sitx part was
very frustrating, as I have no Windows computer. I tried to install the sitx-Expander
in wine, but that did not work.

My approach was to mark one border of the spiral in red, the other in green. How did you do that? I guess not by hand? No, I didn't do it by hand (except in the two places, where the spiral meets the next round). For those places, I've used gimp. I've picked a starting point in the center for the r...

My approach was to mark one border of the spiral in red, the other in green. I also had to do some editing at the places, where the two spirals met. After that, a second program followed each border, and calculated the mid line, thereby examining the bits. BTW: I've started in the center, but also w...

tog wrote:It comes just after Spiral Bits.

Ok, thanks. I was too lazy to try that.

I know how to write a quine program in hvm, but I cannot find a quine challenge, although
I've solved more than 120 challenges (including some hvm challenges). Where is the quine
challenge hidden?

Thank you! That was fast.

I found out, that the hackvm.py script outputs -1 when executing "01-2/p".
Your ide outputs 0.

You can mathematically count the number of loops that is executed and then go from there... I can't remember what exactly it involved but you have to use .NET reflector, I do not know if there is equivalent for linux. I haven't found a linux equivalent, but the following website offers an online de...

This challenge isn't broken. I've just solved it.