Challenge #10 - Everything has beauty, but not everyone sees it
#1
Posted 01 August 2011 - 06:34 PM
#2
Posted 02 August 2011 - 08:42 AM
I solved Step 1.
Many Greetings
MichaelZ
#3
Posted 02 August 2011 - 08:45 AM
Congratz........See if u can find any link like earlier challenge.I solved Step 1.
#4
Posted 02 August 2011 - 09:13 AM
Many Greetings
MichaelZ
#5
Posted 02 August 2011 - 09:45 AM
I have the password, but it is not accepted by http://challenge.99k...llenge_Index=10
Here is what I did:
Password is also not accepted in lowercase
Many Greetings
MichaelZ
#6
Posted 02 August 2011 - 03:42 PM
Wow you are fast
the password you found is correct but is encoded...
#7
Posted 02 August 2011 - 04:41 PM
I didn't get this part. Can you please explain?4) RotX the text using Mopsos (geocaching application), finding Rot33 gives text
THE ARCHIVE PASSWORD IS ALPHAWORKS
#8
Posted 02 August 2011 - 04:46 PM
#9
Posted 02 August 2011 - 04:58 PM
:dubbio:Warning: mysql_connect() [function.mysql-connect]: Too many connections in /www/99k.org/c/h/a/challenge/htdocs/Connections/connChallenge.php on line 9
Fatal error: Too many connections in /www/99k.org/c/h/a/challenge/htdocs/Connections/connChallenge.php on line 9
Are there only 9 trials?
Caesar needs 26!
Peter
#10
Posted 02 August 2011 - 05:01 PM
I apologize, the free hosting site puts a ban on the number of parallel connections that can be made to the database. I can't help you much as of now. Will talk to them to know about the precise limit.After several trials, I got:
:dubbio:
Are there only 9 trials?
Caesar needs 26!
#11
Posted 02 August 2011 - 05:03 PM
One of the easier ciphers to decode is RotX. As Holmes.Sherlock mentioned Ceasar is a well known one, it is Rot3. Another well known one is Rot13 which was used in early days of UseNet (does anyone still know NNTP?). With RotX the text is shifted by an alphabet with X steps. Usually the alphabet is 26 characters a-z. So Rot13 is shifted by half the alphabet and can be easily coded and decoded with a table like this:I didn't get this part. Can you please explain?
A|B|C|D|E|F|G|H|I|J|K|L|M ------------------------- N|O|P|Q|R|S|T|U|V|W|X|Y|Z(C is P and S is F)
and Rot4 would be
A|B|C|D|E|F|G|H|I|J|K|L|M|N|O|P|Q|R|S|T|U|V|W|X|Y|Z|A|B|C|D A|B|C|D|E|F|G|H|I|J|K|L|M|N|O|P|Q|R|S|T|U|V|W|X|Y|Z
To decode the text in this challenge I used an alphabet with 36 characters a-z0-9. Testing Rot33 gave a good result. The tool Mopsos makes it easier to check different alphabets with different shifts.
Many Greetings
MichaelZ
#12
Posted 02 August 2011 - 05:08 PM
Then can you please post a link to the Mospos tool just for the record? This way, when we'll wind up bits & pieces, it's become easier.
#13
Posted 02 August 2011 - 05:12 PM
It can be found at http://mopsos.net'> http://mopsos.net.@MichaelZ
Then can you please post a link to the Mospos tool just for the record? This way, when we'll wind up bits & pieces, it's become easier.
I'm afraid that there is only a German version available. The tool needs to be registered (free of charge), otherwise it will stop working after about a month.
Many Greetings
MichaelZ
#14
Posted 02 August 2011 - 05:19 PM
#15
Posted 02 August 2011 - 05:20 PM
Many Greetings
MichaelZ
#16
Posted 02 August 2011 - 05:21 PM
#17
Posted 02 August 2011 - 05:36 PM
Using Mopsos I decoded the stringIs MosPos output logically different from this?
Wkh dufklyh sdvvzrug lv doskdzrunvfound as stegano in new.png.
Many Greetings
MichaelZ
#18
Posted 02 August 2011 - 06:20 PM
Using Mopsos I decoded the string
Wkh dufklyh sdvvzrug lv doskdzrunvfound as stegano in new.png.
At first sight it does look a lot like Vogon's Poetry
http://en.wikipedia....ki/Vogon#Poetry
but WITHOUT a babelfish!
Wonko
#19
Posted 02 August 2011 - 08:28 PM
Many Greetings
MichaelZ
#21
Posted 03 August 2011 - 06:10 AM
Many Greetings
MichaelZ
#22
Posted 03 August 2011 - 06:15 AM
Can you tell us the configuration of the computer, the character set you used & the time taken so that we can have an estimate the feasibility of bruteforcing a password if required in any future competition?I just came to my poor computer, calculating all night. It had found the correct word in the mean time since it doesn't have so many characters. Probably I should have used the dictionary attack first. I just checked that the word is contained in the word list.
#23
Posted 03 August 2011 - 09:56 AM
The (not very up to date) computer has an ASUS P4C800-E Deluxe motherboard with Intel i875P chipset and Intel Pentium 4 3.0 GHz. Memory is 3 GB (2 1 GB PC2700 and 2 512 MB PC3200). Cain & Able doesn't use multiple threads and no GPU. I used a-z0-9 as alphabet and selected word length 1 to 16. Of course the upper limit was absolutely unrealistic set on that computer, its a keyspace of 8.1E24. I don't know how long it took to find the word but it was finished after 12 hours. The display words/second varied quite a few, it was usually around 3.2E6.Can you tell us the configuration of the computer, the character set you used & the time taken so that we can have an estimate the feasibility of bruteforcing a password if required in any future competition?
Using a more decent computer with multiple cores and nVidia GPU and a software making use of them should be much much faster.
Many Greetings
MichaelZ
#24
Posted 03 August 2011 - 05:01 PM
I run XP on vmware to attack the passwords (using cane)
due to the limitations of vmware only one core can be used(i have a old version of vmware)
The computed time on a 7 letter password(uncapped alphabetic,numeric brute force)is 2 hours 30 Minuets
I would recommend to google the md5 first before attempting a attack
Then do a dictionary attack (with numbers)
then to a brute force
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users