-
-
[原创]KM/CM一枚
-
发表于: 2015-6-12 08:22
-
km是在吾爱上头先发的，这里直接转过来
要求：
提供2组可用Name与AccessCode即可
KM特征：
UPX
关键处有VM，不防爆破
成功时提示：
Access Successfully.
KeygenMe.rar
欢迎各位尝试~
=======================
PS...
如果尝试后无果的话可以对照给出的源码来PJ,KM源码如下：
大牛就跳过哈
期待~
要求：
提供2组可用Name与AccessCode即可
KM特征：
UPX
关键处有VM，不防爆破
成功时提示：
Access Successfully.
KeygenMe.rar
欢迎各位尝试~
=======================
PS...
如果尝试后无果的话可以对照给出的源码来PJ,KM源码如下：
大牛就跳过哈
#include "iostream.h"
#include "stdio.h"
#include "math.h"
#include "VirtualizerSDK.h"
int code[]=
{
149314,149314,138208,85146,39488,134506,119698,123400,124634,39488,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
135740,95018,124634,54296,129570,125868,39488,149314,136974,144378,
46892,141910,124634,124634,39488,143144,128336,129570,141910,39488,
38254,39488,75274,75274,75274,75274,75274,75274,75274,75274,
143144,124634,148080,143144,39488,129570,135740,39488,149314,136974,
38254,75274,75274,75274,75274,75274,75274,75274,75274,75274,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
38254,75274,0,39488,39488,92550,124634,149314,127102,124634,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
38254,135740,95018,124634,39488,120932,149314,39488,149314,149314,
135740,149314,39488,138208,140676,136974,127102,140676,119698,134506,
38254,138208,85146,0,39488,39488,39488,39488,39488,61700,
135740,149314,39488,138208,140676,136974,127102,140676,119698,134506,
38254,59232,60466,65402,55530,66636,55530,60466,60466,0,
141910,54296,129570,143144,39488,138208,140676,136974,145612,124634,
38254,39488,75274,75274,75274,75274,75274,75274,75274,75274,
141910,39488,143144,128336,119698,143144,39488,149314,136974,144378,
38254,75274,75274,75274,75274,75274,75274,75274,75274,75274,
48126,119698,140676,124634,39488,140676,124634,119698,133272,133272,
38254,75274,1522756,1522756,1522756,1522756,1522756,1522756,1522756,0,
149314,39488,127102,140676,124634,119698,143144,40722,81444,59232,
38254,39488,98720,133272,124634,119698,141910,124634,39488,85146,
141910,54296,129570,143144,39488,138208,140676,136974,145612,124634,
38254,135740,143144,124634,140676,39488,109826,136974,144378,140676,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
38254,39488,96252,119698,134506,124634,49360,69104,50594,71572,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
39488,13574,13574,13574,13574,13574,13574,13574,13574,309734,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
75274,136974,273948,410922,547896,684870,821844,958818,1095792,309734,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
76508,81444,83912,78976,115996,78976,2468,3702,7404,309734,
141910,54296,129570,143144,39488,138208,140676,136974,145612,124634,
77742,141910,54296,129570,143144,39488,138208,140676,136974,309734,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
38254,39488,98720,133272,124634,119698,141910,124634,39488,85146,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
38254,135740,143144,124634,140676,39488,80210,122166,122166,124634,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
38254,141910,141910,39488,82678,136974,123400,124634,49360,1522756,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
38254,69104,50594,71572,1522756,1522756,1522756,1522756,1522756,1522756,
144378,140676,39488,97486,83912,39488,136974,140676,39488,119698,
39488,14808,25914,14808,25914,13574,38254,64168,54296,544194,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
78976,233226,161654,166590,170292,186334,135740,12340,24680,568874,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
80210,0,0,0,0,0,0,0,12340,24680,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
81444,0,0,0,0,0,0,0,12340,24680,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
82678,0,0,0,0,0,0,0,12340,24680,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
83912,0,0,0,0,0,0,0,12340,24680,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
85146,0,0,0,0,0,0,0,12340,24680,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
86380,0,0,0,0,0,0,0,12340,24680,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
87614,0,0,0,0,0,0,0,12340,24680,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
88848,0,0,0,0,0,0,0,12340,24680,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
38254,0,39488,107358,140676,136974,135740,127102,56764,1522756,
38254,0,39488,80210,122166,122166,124634,141910,141910,1522756,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
38254,39488,102422,144378,122166,122166,124634,141910,141910,125868,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634,
38254,144378,133272,133272,149314,56764,1522756,1522756,1522756,1522756,
143144,128336,129570,141910,39488,92550,124634,149314,127102,124634
};
char a;
char b[256];
int e;
int ck(int num)
{
if(num!=0)return 1;else return 0;
}
int vmRun(int array[10])
{
VIRTUALIZER_START;//CodeVirtualizer加壳标志，该函数段已使用工具VM
for (int i = 0;i <10;i++)
{
if (i!=0)
{
switch (array[0])
{
case 31:
{
if (array[i]==00) {cout<<endl;break;}
if (array[i]==1234) break;
a=array[i];
cout<<a;
break;
}
}
}
else
{
if (array[0]==32)
{
e=array[9];
cin>>b;
for (int nn =0;nn < 8;nn++)
{
code[array[9]+nn]=b[0+nn];
}
}
if (array[0]==61)
{
for (int nn =0;nn < 8;nn++)
{
code[array[9]+nn]&=array[nn+1];
}
}
if (array[0]==62)
{
for (int nn =0;nn < 8;nn++)
{
if (nn<7)
code[array[9]+nn]+=(int)sin(code[array[9]+nn+1]);
else
code[array[9]+nn]+=(int)sin(code[array[9]]);
}
}
if (array[0]==63)
{
for (int nn =0;nn < 8;nn++)
{
code[array[9]+nn]=(int)(53+4*sin(code[array[9]+nn]));
}
}
if (array[0]==64)
{
for (int nn =0;nn < 8;nn++)
{
code[array[9]+nn]=code[e+nn]-code[251+nn];
}
}
for (int f=65;f<73;f++)
{
if (array[0]==f)
{
return array[9-ck(code[461+f-65])];
}
}
}
}
return 20;
VIRTUALIZER_END;//VM结束
}
void main()
{
int n=0,c=0;
int array[10]={0,0,0,0,0,0,0,0,0,0};
for (int i = 0;i < sizeof(code)/sizeof(code[1]);i+=0)
{
n=0;
while(n<10)
{
array[n]=code[i+n]/1234;
n++;
}
c=vmRun(array);
i+=c;
}
cout<<endl<<endl<<endl<<endl;
getchar();
}
期待~
[招生]科锐逆向工程师培训(2024年11月15日实地，远程教学同时开班, 第51期)
|
|
|---|---|
|
|
|
|
|
|
|
|
对啊，网址没错。
是当地运营商屏蔽了吗，或者是PC的原因，还是国家做的限制。。。 对了，吾爱官方做了个网络诊断器，你可以配合那软件试试看能找出原因否。 
|
|
|
|
|
|
|
|
|
加油
|
|
|
没搞定
 我转到其他地方行吗？
|
|
|
|
|
|
请问逆虚拟机有什么好的办法或者技巧吗？我只会一条一条的一遍一遍的看，真的是很累，很考验体力
|
|
|
其实我挺邪恶地把程序算法处V了一下，所以要逆出算法可以说得费点功夫了，不过追码还是可以的，真码在内存中是明码哦
提示到这儿吧，嘿嘿哪位追出来之后我就贴源码吧
|
|
|
本想挑战一下逆一下算法，现在看完全是自不量力啊
还请希望指点一下怎样才能将水平提升到可以逆虚拟机的高度 |
|
|
这个我用了CodeVirtualizer虚拟算法函数段，分析VM我也不会。。
这个KM主要就是通过监控内存变化来找key的，源码我发上来吧，您对照源码去破解试试~  源码发在主贴里头。 |
|
|
谢谢指点，但是看的还是有点不太明白，我的技术实在是太菜了，我还需努力啊
|
|
|
|
|
|
没人玩了么。。。自个儿顶一下
|
|
|
|
