Reply
Tue 7 Dec, 2004 02:26 am
I will garentee you wont get this one...
There are 8 digits. With every set of 8 digits are accompanied by 4 hex digits. The hex digits are as follows:
0123456789ABCDEF
How do you get the 4 hex digits for the 8 regular digits?
Here are your clues
DIGITS = 00000001 HEX = F326
DIGITS = 00000002 HEX = AF14
DIGITS = 00001000 HEX = 4276
DIGITS = 00001035 HEX = F498
DIGITS = 00001154 HEX = 6BF8
DIGITS = 00001200 HEX = 3E9B
If you wanna bet Rayman, count me in for 50 dollars that I dont get it
I am so confident, I would take that
Is there a logical/arithmetic relationship between the eight (decimal?) digits and the four hex digits, or is this something like what's stored in memory at certain addresses on your computer when you run a certain application?
There is a mathamatical algorithm I'm sure.
The guy who made it had it as a crackme program (a program that is nothing but a password screen, then when you can crack a passcode it congradulates you). I have yet to find out how you get the hex digits, but he has explained to me how it is 8 digits followed by 4 hex digits. He gave me the codes as a hint.
(Yes, I did ask if I could post it here)
It sounds like a hash function:
Google define:hash function wrote:(Also: Hash Algorithm.) Function for computing from any input data a cryptographic checksum of given length. For good hash functions it is extremely improbable to retrieve the input data from the hash value or to find different inputs resulting in the same hash value.
A function that maps a variable-length data block or message into a fixed length value called a hash code. The function is designed in such a way that, when protected, it provides an authenticator to the data or message. Also referred to as a direct message digest.
Functions that take variable length input to produce fixed length output, called a cryptographic checksum. A strong hash function must be irreversible and collision free. Key lengths are typically recommended to be twice that of symmetric key cryptography , because of a possible spoof where an attacker generates two messages with the same checksum. The average number of generations required is 2**n/2 rather than 2**n. Well known hash functions include HMAC, MD5 and SHA-1.
The four-digit hex number has 65536 unique values, obviously smaller than the 100,000,000 possible 8-digit decimal numbers. Every hex number should correspond to approximately 1526 decimal numbers.
Hah, so you are saying that it is basically impossible to crack his code?
Rayman wrote:I am so confident, I would take that
You misunderstood me Rayman, I,m betting I
CAN'T get it.
I'm saying it depends on whether it is a good hash function or not. The hash result is pretty short; given enough data it is probably possible to crack it.
It may be possible to crack it with the output we have, but I'm not a cryptographer. You might cross-post to the science and mathematics forum.
I posted this on a site that has thousands of university students, one of them posted these clues.
By the way this means nothing to me, so dont shout at the messenger.
Oh, OK, I get it. What the riddle is trying to say is that there is a certain way of converting those 8 decimal digits (00001200 and the rest) into those particular hexadecimal digits (3E98 in this case).
The way to solve it is through algebra - converting the hex to decimal first is probably the easiest, then finding the pattern. The zeroes in the decimal side is also likely to be significant. Since I do this type of **** all year long, excuse my lack of enthusias. I did, however, convert the hex to decimal in all 8 examples, and the decimal to hex as well, for those who want to crunch the numbers.
Clues - both decimal
00000001 = 00062246
00000002 = 00044820
00001000 = 00017014
00001035 = 00062614
00001154 = 00027640
00001200 = 00016027
Clues - both hex
0001 = F326
0002 = AF14
03E8 = 4276
040B = F498
0482 = 6BF8
04B0 = 3E9B
Enjoy
That should definately help.
*gets busy trying to crunch numbers*
Stumble It!
Tweet This
Bookmark on Delicious
Share on Facebook
Share on MySpace