Thank you for reply!
I am just trying to imagine how the erase password calculation is working, and want to calculate myself erase hash(for MBcan) without asking another members to calculate...
So the erase password is the -101th hash from the Sonderhash.
The hash calculation is one way, so it is not possible to calculate the reverse hash.
My idea is: Here (at the bottom of the page) are a HASH list calculator which can calculate the hashes to a file. So I will type 00 00 00 00 00 00 00 00 to Initial HASH, check the "output to file" checkbox and press the "Make" button. It will generate a text file which contains a lot of hashes. After that I will write 00 00 00 00 00 00 00 01 to Initial HASH, and press again the "Make" button and it will generate again a lot of hashes. I will make this while I reach FF FF FF FF FF FF FF FF FF in the initial hash(an application written in Delphi/RAD Studio will write to the initial hash box).
After that I will have a very big database, and for example I search out the 7A 17 E6 52 5D 0C C7 64* hash and go up 101 row which (in theory) will be 5C 38 A4 18 1D 51 F3 48*. And PROBLEM SOLVED.
Ficho, what is your opinion from this? It will be possible?
*It was an example from what ficho calculated for me in summer.
Last edited by tferenc; 4th January, 2018 at 01:20 PM.
HI, I don't remember what I have done for you, but calculate the space that is needed for such a task ??? people use so called rainbow tables (or some other type of db tables) to reduce space needed and include/reduce cpu/gpu power needed for calculation of one hash that is requested.
Also creating these tables take so much time, calculate the time to hashfucnc() one hash a 0x1000000 times, then multiply by0x10000000000 you will get all combinations, so it is almost impossible to achieve the idea you have...
regards
tferenc (4th January, 2018)
tferenc (4th January, 2018)
ficho helped me here: http://www.digital-kaos.co.uk/forums...=1#post3086878
Storing the result of an "Initial HASH" calculation needs 8*196608=1.572.864 bytes.
We need to calculate from the "Initial HASH" 1,208,925,819,614,600,192,888,200 times(=while we reach FF FF FF FF FF FF FF FF), which means that we will have a database which consists from 1,901,475,899,999, 999,744,240,016,104,408 bytes. (=1901 Yottabyte=1,901,475,899,999,999,744 Terabyte).
It is impossible to store.
Second option is to write 00 00 00 00 00 00 00 00 to the Initial HASH, press the "calculate" button, check the output file if contains 7A 17 E6 52 5D 0C C7 64, if not contains, then delete the output file, then write 00 00 00 00 00 00 00 01 to the Initial HASH, press again the "calculate" button, check again, delete again, until we find 7A 17 E6 52 5D 0C C7 64. After we found, go up 101 row, and here is the erase password.
It will need a good computer, but who cares when I have acces to a server with 2x Intel Xeon and 32GB RAM...
The problem starts there that I not know the algorithm to calculate +1th hash, and the calculator what I found needs the MBir hardware and I have just MBcan.
Ficho/daxxer do you know anything about calculating the +1th hash?
Last edited by tferenc; 4th January, 2018 at 07:31 PM.
Hello
to renew for example: ESL or ECU or gearbox.
you need to have tokens or it's free.
because whenever I click on GET I have a password failure
thanks
It is token free!
Sent from my iPhone using Tapatalk
hi thanks for answering
here are two examples
thanks
Last edited by minomino; 6th January, 2018 at 01:56 PM.
Xhorse VVDI PROG Adapter Kit for Mercedes Benz EIS/EZS Full 10 pcs
https://www.norman-keys.com/xhorse-v...zs-full-10-pcs
habbyb (7th January, 2018)
Bookmarks