how can i crack hexmd5 hash ?

[monminamon]

the only problem is that your capture starts in the middle and ends in the middle and therefore only one complete exchange is captured.

Let's make it very clear.

The javascript + salt is the question (Q).
the hash/password is the answer (A).

you always need to have a question Qx and a corresponding answer Ax. (x is the number of exchange, Q1 is question for exchange 1, A1 is answer for exchange 1)

What we need is this (ideal situation):
First question, then answer. First question, then answer. First question, then answer.

First question Q1, then answer A1.
First question Q2, then answer A2.
First question Q3, then answer A3. etc

Back to the non-ideal case (your capture):
Your capture starts in the middle with an answer (no question) and stops without an answer (only question).

Your capture looks like this:
1) answer 1: A1 (question missing. ERROR. VERY BAD)
2) question 2: Q2 (we still need an answer, let's see... )
3) answer 2: A2 (hurray! we got an answer for Q2, we have now a full exchange with question Q2 and answer A2, very good)
4) question 3: Q3 (the capture stops here, no more answer. ERROR: A3 missing, VERY BAD)


only question Q2 (hexMD5('\137' + document.login.password.value + '\115\116\213\305\117\073\313\206\013\042\106\121\240\001\333\032')) and answer A2 (cbc5d1a36621e0f824f5491ae9cf172c) are usable and VERY GOOD
the remaining parts can't be used, A1 and Q3 are useless, because Q1 and A3 are missing. VERY BAD

we always need first question Qx and corresponding answer Ax

this well explained and all
but isn't this
hexMD5('\115' + document.login.password.value + '\017\226\132\264\231\243\072\025\142\343\313\006\131\010\106\311');

is the Q1 for the A1 ?!
what's bad with it ?!