charles破解
下载最新Charles，官网地址：Charles官网
下载安装后，使用破解工具自动生成激活码
Charles激活码自动生成工具
具体用法如下：
打开激活工具，输入RegisterName名称，名称可任意输入，点击生成即可自动生成激活码
打开Charles，点击help，选择Register Charles，输入生成的名称以及key，即可成功注册
重启Charles工具，此时不存在30天免费的提示
package mainimport ("bytes""encoding/binary""fmt""math/rand""time"
)const (rounds = 12roundKeys = 2 * (rounds + 1)
)func main() {rand.Seed(time.Now().UnixNano())name := "charles"fmt.Println("name:", name, " key:", crack(name))
}func crack(text string) string {name := []byte(text)length := len(name) + 4padded := ((-length) & (8 - 1)) + lengthbs := make([]byte, 4)binary.BigEndian.PutUint32(bs, uint32(len(name)))buff := bytes.Buffer{}buff.Write(bs)buff.Write(name)var ckName int64 = 0x7a21c951691cd470var ckKey int64 = -5408575981733630035ck := newCkCipher(ckName)outBuff := bytes.Buffer{}for i := 0; i < padded; i += 8 {bf := buff.Bytes()[i : i+8]buf := bytes.NewBuffer(bf)var nowVar int64if err := binary.Read(buf, binary.BigEndian, &nowVar); err != nil {panic(err)}dd := ck.encrypt(nowVar)outBuff.WriteByte(byte(dd >> 56))outBuff.WriteByte(byte(dd >> 48))outBuff.WriteByte(byte(dd >> 40))outBuff.WriteByte(byte(dd >> 32))outBuff.WriteByte(byte(dd >> 24))outBuff.WriteByte(byte(dd >> 16))outBuff.WriteByte(byte(dd >> 8))outBuff.WriteByte(byte(dd))}var n int32for _, b := range outBuff.Bytes() {n = rotateLeft(n^int32(int8(b)), 0x3)}prefix:= n ^ 0x54882f8asuffix:=rand.Int31()in := int64(prefix) << 32s := int64(suffix)switch suffix >> 16 {case 0x0401:case 0x0402:case 0x0403:in |= sbreakdefault:in |= 0x01000000 | (s & 0xffffff)break}out := newCkCipher(ckKey).decrypt(in)var n2 int64for i := 56; i >= 0; i -= 8 {n2 ^= int64((uint64(in) >> i) & 0xff)}vv := int32(n2 & 0xff)if vv < 0 {vv = -vv}return fmt.Sprintf("%02x%016x", vv, uint64(out))
}type ckCipher struct {rk [roundKeys]int32
}func newCkCipher(ckKey int64) ckCipher {ck := ckCipher{}var ld [2]int32ld[0] = int32(ckKey)ld[1] = int32(uint64(ckKey) >> 32)ck.rk[0] = -1209970333for i := 1; i < roundKeys; i++ {ck.rk[i] = ck.rk[i-1] + -1640531527}var a, b int32var i, j intfor k := 0; k < 3*roundKeys; k++ {ck.rk[i] = rotateLeft(ck.rk[i]+(a+b), 3)a = ck.rk[i]ld[j] = rotateLeft(ld[j]+(a+b), a+b)b = ld[j]i = (i + 1) % roundKeysj = (j + 1) % 2}return ck
}func (ck ckCipher) encrypt(in int64) int64 {a := int32(in) + ck.rk[0]b := int32(uint64(in)>>32) + ck.rk[1]for r := 1; r <= rounds; r++ {a = rotateLeft(a^b, b) + ck.rk[2*r]b = rotateLeft(b^a, a) + ck.rk[2*r+1]}return pkLong(a, b)
}func (ck ckCipher) decrypt(in int64) int64 {a := int32(in)b := int32(uint64(in) >> 32)for i := rounds; i > 0; i-- {b = rotateRight(b-ck.rk[2*i+1], a) ^ aa = rotateRight(a-ck.rk[2*i], b) ^ b}b -= ck.rk[1]a -= ck.rk[0]return pkLong(a, b)
}func rotateLeft(x int32, y int32) int32 {return int32(x<<(y&(32-1))) | int32(uint32(x)>>(32-(y&(32-1))))
}func rotateRight(x int32, y int32) int32 {return int32(uint32(x)>>(y&(32-1))) | int32(x<<(32-(y&(32-1))))
}func pkLong(a int32, b int32) int64 {return (int64(a) & 0xffffffff) | (int64(b) << 32)
}