有关swf加密的一点感想

最近想把某flash游戏的1代和2代下载下来玩，但是都有域名验证，于是只好搬出decompiler

1代没有加密，结果是这么判断的

if(_url.indexOf("http://") != -1){
// ok
}else{
// error
}

当然直接爆破就好了
2代加了密，而且好像是swfencypt的模式，一开始是想放弃了,但是一想其实那个swfencrypt只是插了段恶心的tag，代码其实没有变，所以想碰碰运气

于是接着看1代的raw code，如下

//96 0e 00 08 00 07 01 00 00 00 08 01 07 0f 00 00 00
_push "http://" 1 "" 15
//22
_getProperty
//96 02 00 08 02
_push "indexOf"
//52
_callMethod
//96 05 00 07 ff ff ff ff
_push 4294967295
//49
_equals2
//12
_not
//4c
_dup
//12
_not
//9d 02 00 23 00
_if true goto #21

原来得到_url是靠压一个0f进栈，然后调22

然后拿ue去2代的swf里搜0f 00 00 00 22，只有一处，我晕，然后往后看，很多都和1代代码相似，只是'indexOf'的位置不一样，所以push的值也有少许区别。

由于判断的是!=，所以一般会有个not，结果不远处果然有个 12 9d，然后把12改成01。

然后竟然就能玩了。。。

感想是：

1.swfencrypt的加密某种方面来说还是很弱
2.写代码时注意安全才是最重要的 -- 但是给程序员带来了而外的麻烦。。。
3.今天运气不错~~

Comments

Determine Perspective Lines With Off-page Vanishing Point

In perspective drawing, a vanishing point represents a group of parallel lines, in other words, a direction. For any point on the paper, if we want a line towards the same direction (in the 3d space), we simply draw a line through it and the vanishing point. But sometimes the vanishing point is too far away, such that it is outside the paper/canvas. In this example, we have a point P and two perspective lines L1 and L2. The vanishing point VP is naturally the intersection of L1 and L2. The task is to draw a line through P and VP, without having VP on the paper. I am aware of a few traditional solutions: 1. Use extra pieces of paper such that we can extend L1 and L2 until we see VP. 2. Draw everything in a smaller scale, such that we can see both P and VP on the paper. Draw the line and scale everything back. 3. Draw a perspective grid using the Brewer Method. #1 and #2 might be quite practical. #3 may not guarantee a solution, unless we can measure distances/p...

Chasing an IO Phantom

My home server has been weird since months ago, it just becomes unresponsive occassionally. It is annoying but it happens only rarely, so normally I'd just wait or reboot it. But weeks ago I decided to get to the bottom of it. What's Wrong My system set up is: Root: SSD, LUKS + LVM + Ext4 Data: HDD, LUKS + ZFS 16GB RAM + 1GB swap Rootless dockerd The system may become unresponsive, when the IO on HDD is persistantly high for a while. Also: Often kswapd0 has high CPU High IO on root fs (SSD) From dockerd and some containers RAM usage is high, swap usage is low It is very strange that IO on HDD can affect SSD. Note that when this happens, even stopping the IO on HDD does not always help. Usually restarting dockerd does not help, but rebooting helps. Investigation: Swap An obvious potential root cause is the swap. High CPU on kswapd0 usually means the free memory is low and the kernel is busy exchanging data between disk and swap. However, I tried the following steps, none of the...

Moving Items Along Bezier Curves with CSS Animation (Part 2: Time Warp)

This is a follow-up of my earlier article. I realized that there is another way of achieving the same effect. This article has lots of nice examples and explanations, the basic idea is to make very simple @keyframe rules, usually just a linear movement, then use timing function to distort the time, such that the motion path becomes the desired curve. I'd like to call it the "time warp" hack. Demo See the Pen Interactive cubic Bezier curve + CSS animation by Lu Wang ( @coolwanglu ) on CodePen . How does it work? Recall that a cubic Bezier curve is defined by this formula : \[B(t) = (1-t)^3P_0+3(1-t)^2tP_1+3(1-t)t^2P_2+t^3P_3,\ 0 \le t \le 1.\] In the 2D case, \(B(t)\) has two coordinates, \(x(t)\) and \(y(t)\). Define \(x_i\) to the be x coordinate of \(P_i\), then we have: \[x(t) = (1-t)^3x_0+3(1-t)^2tx_1+3(1-t)t^2x_2+t^3x_3,\ 0 \le t \le 1.\] So, for our animated element, we want to make sure that the x coordiante (i.e. the "left" CSS property) is \(...

WangLu's Notes

Search This Blog