Question What Ever Happened To Script Vessel?

[Infernusx0]

Did it die off?

Cause I kno people were trying to crack it for a long time.

no success?

[AcidAlchamy]

Lol;

Sumi the person hacking and giving out the exploit version gave up once the Admin of Script Vessel added a 2nd MD5 (Message-Digest algorithm 5)

[Only registered and activated users can see links. ]

So no, their well not be another cracked sv...ever (most likely..)

Better of just buying it. Its worth it and pays for it self.

In the past 2-3 weeks I've gained close to 20+ Dbs, not to mention Supers and what not.

~Acid Alchamy~ <--A Proud SV User.

[Lateralus]

Originally Posted by AcidAlchamy

Lol;

Sumi the person hacking and giving out the exploit version gave up once the Admin of Script Vessel added a 2nd MD5 (Message-Digest algorithm 5)

[Only registered and activated users can see links. ]

So no, their well not be another cracked sv...ever (most likely..)

Better of just buying it. Its worth it and pays for it self.

In the past 2-3 weeks I've gained close to 20+ Dbs, not to mention Supers and what not.

~Acid Alchamy~ <--A Proud SV User.

It can be cracked using olly, I'm just having a hard time navigating through all the calls.

[AcidAlchamy]

lmao, at your age 17 (even me at 16/with my dad and his MBA, MD5 is still quite hard) So believe me YOU I doubt would be the one to crack it. The reason Sumi is the one to crack is because he is currently in MIT. and while being at school hes been having teachers and others help him out. Though school is more important then programs so cant blame him from starting.

and believe me, I can garantue that you dont know Algorithm lol...alot of people dont (unless taking the college classes of course)

Algorithm

[Only registered and activated users can see links. ] [Only registered and activated users can see links. ]
Figure 1. One MD5 operation-MD5 consists of 64 of these operations, grouped in four rounds of 16 operations. F is a nonlinear function; one function is used in each round. Mi denotes a 32-bit block of the message input, and Ki denotes a 32-bit constant, different for each operation.




[Only registered and activated users can see links. ]s denotes a left bit rotation by s places; s varies for each operation. [Only registered and activated users can see links. ] denotes addition modulo [[232]].
MD5 processes a variable-length message into a fixed-length output of 128 bits. The input message is broken up into chunks of 512-bit blocks (sixteen 32-bit [Only registered and activated users can see links. ] integers); the message is [Only registered and activated users can see links. ] so that its length is divisible by 512. The padding works as follows: first a single bit, 1, is appended to the end of the message. This is followed by as many zeros as are required to bring the length of the message up to 64 bits fewer than a multiple of 512. The remaining bits are filled up with a 64-bit integer representing the length of the original message, in bits.
The main MD5 algorithm operates on a 128-bit state, divided into four 32-bit words, denoted A, B, C and D. These are initialized to certain fixed constants. The main algorithm then operates on each 512-bit message block in turn, each block modifying the state. The processing of a message block consists of four similar stages, termed rounds; each round is composed of 16 similar operations based on a non-linear function F, [Only registered and activated users can see links. ], and left rotation. Figure 1 illustrates one operation within a round. There are four possible functions F; a different one is used in each round:
denote the [Only registered and activated users can see links. ], [Only registered and activated users can see links. ], [Only registered and activated users can see links. ] and [Only registered and activated users can see links. ] operations respectively.

Pseudocode

[Only registered and activated users can see links. ] for the MD5 algorithm follows.

//Note: All variables are unsigned 32 bits and wrap modulo 2^32 when calculating
var int[64] r, k

//r specifies the per-round shift amounts
r[ 0..15] := {7, 12, 17, 22,  7, 12, 17, 22,  7, 12, 17, 22,  7, 12, 17, 22} 
r[16..31] := {5,  9, 14, 20,  5,  9, 14, 20,  5,  9, 14, 20,  5,  9, 14, 20}
r[32..47] := {4, 11, 16, 23,  4, 11, 16, 23,  4, 11, 16, 23,  4, 11, 16, 23}
r[48..63] := {6, 10, 15, 21,  6, 10, 15, 21,  6, 10, 15, 21,  6, 10, 15, 21}

//Use binary integer part of the sines of integers (Radians) as constants:
for i from 0 to 63
    k[i] := floor(abs(sin(i + 1)) × (2 pow 32))

//Initialize variables:
var int h0 := 0x67452301
var int h1 := 0xEFCDAB89
var int h2 := 0x98BADCFE
var int h3 := 0x10325476

//Pre-processing:
append "1" bit to message
append "0" bits until message length in bits ≡ 448 (mod 512)
append bit /* bit, not byte */ length of unpadded message as 64-bit little-endian integer to message

//Process the message in successive 512-bit chunks:
for each 512-bit chunk of message
    break chunk into sixteen 32-bit little-endian words w[i], 0 ≤ i ≤ 15

    //Initialize hash value for this chunk:
    var int a := h0
    var int b := h1
    var int c := h2
    var int d := h3

    //Main loop:
    for i from 0 to 63
        if 0 ≤ i ≤ 15 then
            f := (b and c) or ((not b) and d)
            g := i
        else if 16 ≤ i ≤ 31
            f := (d and b) or ((not d) and c)
            g := (5×i + 1) mod 16
        else if 32 ≤ i ≤ 47
            f := b xor c xor d
            g := (3×i + 5) mod 16
        else if 48 ≤ i ≤ 63
            f := c xor (b or (not d))
            g := (7×i) mod 16
 
        temp := d
        d := c
        c := b
        b := b + leftrotate((a + f + k[i] + w[g]) , r[i])
        a := temp

    //Add this chunk's hash to result so far:
    h0 := h0 + a
    h1 := h1 + b 
    h2 := h2 + c
    h3 := h3 + d

var int digest := h0 append h1 append h2 append h3 //(expressed as little-endian) 

//leftrotate function definition
  leftrotate (x, c) 
      return (x << c) or (x >> (32-c));

Note: Instead of the formulation from the original [Only registered and activated users can see links. ] shown, the following may be used for improved efficiency (useful if assembly language is being used - otherwise, the compiler will generally optimize the above code. Since each computation is dependent on another in these formulations, this is often slower than the above method where the nand/and can be parallelised):

(0  ≤ i ≤ 15): f := d xor (b and (c xor d))
(16 ≤ i ≤ 31): f := c xor (d and (b xor c))

Enjoy!

~Acid Alchamy~

[Lateralus]

Originally Posted by AcidAlchamy

lmao, at your age 17 (even me at 16/with my dad and his MBA, MD5 is still quite hard) So believe me YOU I doubt would be the one to crack it. The reason Sumi is the one to crack is because he is currently in MIT. and while being at school hes been having teachers and others help him out. Though school is more important then programs so cant blame him from starting.

and believe me, I can garantue that you dont know Algorithm lol...alot of people dont (unless taking the college classes of course)

Believe me, I'm not trying to crack the password, I'm cracking through noping the call to the login server by reverse engineering in ASM using OllyDBG.. and I'm pretty experienced in ASM. anastasia cracked it through ASM, and I know a few other people who have and it's not as difficult as people make it out to be. Thank you very much for doubting me.

[AcidAlchamy]

Lol people were doin that last year, if you didnt know (and i dun think u do because u dun really know "Shiku" like me, and i get updated client before most..) he adds onto his program almost every day. You think he's willing to honestly lose THOUSANDS of grand's every month because some one is gonna crack it?

I dun think so,

We;ve had our fair share with it, and i support cracking it 100% just so others can use it (I dun pay for sv so dun bug me) But I can garantue that its patched or fixed after moment of beeing cracked, because even I got rl friends cracking it every day, except every day he patches it...


Do what you can. More power to you.

~Acid Alchamy~

[Lateralus]

Originally Posted by AcidAlchamy

Lol people were doin that last year, if you didnt know (and i dun think u do because u dun really know "Shiku" like me, and i get updated client before most..) he adds onto his program almost every day. You think he's willing to honestly lose THOUSANDS of grand's every month because some one is gonna crack it?

I dun think so,

We;ve had our fair share with it, and i support cracking it 100% just so others can use it (I dun pay for sv so dun bug me) But I can garantue that its patched or fixed after moment of beeing cracked, because even I got rl friends cracking it every day, except every day he patches it...


Do what you can. More power to you.

~Acid Alchamy~

Wowww. Ask anyone who's good at assembly - once I crack SV, it won't be hard at all to crack it again after it's been updated. Why? The only changes are the addresses. Future also cued me in on several ways it's been cracked. YOU have probably never used a disassembler in your life.

I realize people haven't (publically) cracked it since last year. But you see, if I wouldn't release it, "Shiku" wouldn't need to change anything except the addresses.

Ask your friends how they're cracking it? Because if they're trying to decrypt MD5, it's going to take them forever.

[ViRuSeXy]

you can use old SV jest you need edite helf of co clinte....
coz old one work he jest no see [Conquer 2.o]
he say game no runing coz he cant see ther is difrent font same as cospeed from fuje old version of speed difrent fonts... jest need figur out how old SV can see new clinte of Conquer thet all y need crack it agen ? may be for you is sound stupid am sure thet can be done COPartner alws easy same think and alws work

[Lateralus]

Originally Posted by ViRuSeXy

you can use old SV jest you need edite helf of co clinte....
coz old one work he jest no see [Conquer 2.o]
he say game no runing coz he cant see ther is difrent font same as cospeed from fuje old version of speed difrent fonts... jest need figur out how old SV can see new clinte of Conquer thet all y need crack it agen ? may be for you is sound stupid am sure thet can be done COPartner alws easy same think and alws work

Yes, but ALL memory addresses have changed. We'd have to go in and manually find the new ones, then update them. It'd be easier just to crack the program, considering anyone that good with ASM should be able to crack it easily. ;)