POST 请大神帮忙

秀才遇到兵 · 发表于 2018-2-15 14:17:23

求数据的加密过程及数据原型想知道数据原型是从哪里来的
提交内容的原型及加密过程
选的是后二直选复式

谢谢各位大神

地址：https://www.zb01.cc/?s=/Lottery/confirmAddOrder
账号:mingxiang
密码:z123456
提交内容：

zipinfo=Nc1BCoMwEIXhu7x1FrG00fQqRqTGsQSihhIXIt69o0lWw%2Fv4YQ58PzP1bsQbSkKkGfeQ7Kmz2N36kr0elZZKcTxQ7N0yraxtayANOsG3MRAGmleXo3kdiaO6zM1HF%2FxFVaZAP0tLvF8zS5x%2F

:authority:
www.zb01.cc
:method:
POST
:path:
/?s=/Lottery/confirmAddOrder
:scheme:
https
accept:
text/html, */*; q=0.01
accept-encoding:
gzip, deflate, br
accept-language:
zh-CN,zh;q=0.8
content-length:
158
content-type:
application/x-www-form-urlencoded; charset=UTF-8
cookie:
__cfduid=dd99b8b2637f54c4e9f379ca36580f3b61518630653; __guid=108850180.104477226910197.1518630353695.0059; PHPSESSID=k6q0iaqh4bckte24numpn8fo14; SERVERID=zb_web6; think_language=zh-CN; txffc_provision_5021355=2018-02-15; show_hid_switch=0; betMode=7; monitor_count=16; think_template=zb01
origin:
https://www.zb01.cc
referer:
https://www.zb01.cc/?s=/Lottery/index/game/Txffc/
user-agent:
Mozilla/5.0 (Windows NT 6.1) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/55.0.2883.87 Safari/537.36
x-requested-with:
XMLHttpRequest

Decimal · 发表于 2018-2-15 14:17:24

Decimal 发表于 2018-2-15 16:03
{"game_id":"28","game_type_id":15,"game_cycle_id":"65296938","bet_info":"[[\"04\",\"05\",\"07\"]]"," ...

再补充一下这个网站的所有编码都是用的这个

羽傲天 · 发表于 2018-2-15 14:32:03

QQ1357702759，欢迎你定制

小R软件 · 发表于 2018-2-15 14:35:43

虽然不知道你用户组怎么来的，大过年的就帮你一下吧；

QQ截图20180215143505.jpg

小白变大神 · 发表于 2018-2-15 15:23:52

调用方法：encryption('{"user_account":"账号","user_password":"密码","captcha":"验证码"}') 注意引号

Decimal · 发表于 2018-2-15 15:27:21

function b64(data)<br />
{<br />
tmp_b64 = zip_deflate(data);<br />
zipinfo = base64_encode(tmp_b64);<br />
        return zipinfo;<br />
}<br />
<br />
<br />
var zip_WSIZE = 32768; // Sliding Window size<br />
var zip_STORED_BLOCK = 0;<br />
var zip_STATIC_TREES = 1;<br />
var zip_DYN_TREES = 2;<br />
<br />
/* for deflate */<br />
var zip_DEFAULT_LEVEL = 6;<br />
var zip_FULL_SEARCH = true;<br />
var zip_INBUFSIZ = 32768; // Input buffer size<br />
var zip_INBUF_EXTRA = 64; // Extra buffer<br />
var zip_OUTBUFSIZ = 1024 * 8;<br />
var zip_window_size = 2 * zip_WSIZE;<br />
var zip_MIN_MATCH = 3;<br />
var zip_MAX_MATCH = 258;<br />
var zip_BITS = 16;<br />
// for SMALL_MEM<br />
var zip_LIT_BUFSIZE = 0x2000;<br />
var zip_HASH_BITS = 13;<br />
// for MEDIUM_MEM<br />
// var zip_LIT_BUFSIZE = 0x4000;<br />
// var zip_HASH_BITS = 14;<br />
// for BIG_MEM<br />
// var zip_LIT_BUFSIZE = 0x8000;<br />
// var zip_HASH_BITS = 15;<br />
if (zip_LIT_BUFSIZE > zip_INBUFSIZ) alert("error: zip_INBUFSIZ is too small");<br />
if ((zip_WSIZE << 1) > (1 << zip_BITS)) alert("error: zip_WSIZE is too large");<br />
if (zip_HASH_BITS > zip_BITS - 1) alert("error: zip_HASH_BITS is too large");<br />
if (zip_HASH_BITS < 8 || zip_MAX_MATCH != 258) alert("error: Code too clever");<br />
var zip_DIST_BUFSIZE = zip_LIT_BUFSIZE;<br />
var zip_HASH_SIZE = 1 << zip_HASH_BITS;<br />
var zip_HASH_MASK = zip_HASH_SIZE - 1;<br />
var zip_WMASK = zip_WSIZE - 1;<br />
var zip_NIL = 0; // Tail of hash chains<br />
var zip_TOO_FAR = 4096;<br />
var zip_MIN_LOOKAHEAD = zip_MAX_MATCH + zip_MIN_MATCH + 1;<br />
var zip_MAX_DIST = zip_WSIZE - zip_MIN_LOOKAHEAD;<br />
var zip_SMALLEST = 1;<br />
var zip_MAX_BITS = 15;<br />
var zip_MAX_BL_BITS = 7;<br />
var zip_LENGTH_CODES = 29;<br />
var zip_LITERALS = 256;<br />
var zip_END_BLOCK = 256;<br />
var zip_L_CODES = zip_LITERALS + 1 + zip_LENGTH_CODES;<br />
var zip_D_CODES = 30;<br />
var zip_BL_CODES = 19;<br />
var zip_REP_3_6 = 16;<br />
var zip_REPZ_3_10 = 17;<br />
var zip_REPZ_11_138 = 18;<br />
var zip_HEAP_SIZE = 2 * zip_L_CODES + 1;<br />
var zip_H_SHIFT = parseInt((zip_HASH_BITS + zip_MIN_MATCH - 1) / zip_MIN_MATCH);<br />
<br />
/* variables */<br />
var zip_free_queue;<br />
var zip_qhead, zip_qtail;<br />
var zip_initflag;<br />
var zip_outbuf = null;<br />
var zip_outcnt, zip_outoff;<br />
var zip_complete;<br />
var zip_window;<br />
var zip_d_buf;<br />
var zip_l_buf;<br />
var zip_prev;<br />
var zip_bi_buf;<br />
var zip_bi_valid;<br />
var zip_block_start;<br />
var zip_ins_h;<br />
var zip_hash_head;<br />
var zip_prev_match;<br />
var zip_match_available;<br />
var zip_match_length;<br />
var zip_prev_length;<br />
var zip_strstart;<br />
var zip_match_start;<br />
var zip_eofile;<br />
var zip_lookahead;<br />
var zip_max_chain_length;<br />
var zip_max_lazy_match;<br />
var zip_compr_level;<br />
var zip_good_match;<br />
var zip_nice_match;<br />
var zip_dyn_ltree;<br />
var zip_dyn_dtree;<br />
var zip_static_ltree;<br />
var zip_static_dtree;<br />
var zip_bl_tree;<br />
var zip_l_desc;<br />
var zip_d_desc;<br />
var zip_bl_desc;<br />
var zip_bl_count;<br />
var zip_heap;<br />
var zip_heap_len;<br />
var zip_heap_max;<br />
var zip_depth;<br />
var zip_length_code;<br />
var zip_dist_code;<br />
var zip_base_length;<br />
var zip_base_dist;<br />
var zip_flag_buf;<br />
var zip_last_lit;<br />
var zip_last_dist;<br />
var zip_last_flags;<br />
var zip_flags;<br />
var zip_flag_bit;<br />
var zip_opt_len;<br />
var zip_static_len;<br />
var zip_deflate_data;<br />
var zip_deflate_pos;<br />
<br />
/* constant tables */<br />
var zip_extra_lbits = new Array(<br />
0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0);<br />
var zip_extra_dbits = new Array(<br />
0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13);<br />
var zip_extra_blbits = new Array(<br />
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 3, 7);<br />
var zip_bl_order = new Array(<br />
16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15);<br />
var zip_configuration_table = new Array(<br />
new zip_DeflateConfiguration(0, 0, 0, 0),<br />
new zip_DeflateConfiguration(4, 4, 8, 4),<br />
new zip_DeflateConfiguration(4, 5, 16, 8),<br />
new zip_DeflateConfiguration(4, 6, 32, 32),<br />
new zip_DeflateConfiguration(4, 4, 16, 16),<br />
new zip_DeflateConfiguration(8, 16, 32, 32),<br />
new zip_DeflateConfiguration(8, 16, 128, 128),<br />
new zip_DeflateConfiguration(8, 32, 128, 256),<br />
new zip_DeflateConfiguration(32, 128, 258, 1024),<br />
new zip_DeflateConfiguration(32, 258, 258, 4096));<br />
<br />
/* objects (deflate) */<br />
<br />
function zip_DeflateCT() {<br />
    this.fc = 0; // frequency count or bit string<br />
    this.dl = 0; // father node in Huffman tree or length of bit string<br />
}<br />
<br />
function zip_DeflateTreeDesc() {<br />
    this.dyn_tree = null; // the dynamic tree<br />
    this.static_tree = null; // corresponding static tree or NULL<br />
    this.extra_bits = null; // extra bits for each code or NULL<br />
    this.extra_base = 0; // base index for extra_bits<br />
    this.elems = 0; // max number of elements in the tree<br />
    this.max_length = 0; // max bit length for the codes<br />
    this.max_code = 0; // largest code with non zero frequency<br />
}<br />
<br />
/* Values for max_lazy_match, good_match and max_chain_length, depending on<br />
 * the desired pack level (0..9). The values given below have been tuned to<br />
 * exclude worst case performance for pathological files. Better values may be<br />
 * found for specific files.<br />
 */<br />
function zip_DeflateConfiguration(a, b, c, d) {<br />
    this.good_length = a; // reduce lazy search above this match length<br />
    this.max_lazy = b; // do not perform lazy search above this match length<br />
    this.nice_length = c; // quit search above this match length<br />
    this.max_chain = d;<br />
}<br />
<br />
function zip_DeflateBuffer() {<br />
    this.next = null;<br />
    this.len = 0;<br />
    this.ptr = new Array(zip_OUTBUFSIZ);<br />
    this.off = 0;<br />
}<br />
<br />
/* routines (deflate) */<br />
<br />
function zip_deflate_start(level) {<br />
    var i;<br />
<br />
    if (!level) level = zip_DEFAULT_LEVEL;<br />
    else if (level < 1) level = 1;<br />
    else if (level > 9) level = 9;<br />
<br />
    zip_compr_level = level;<br />
    zip_initflag = false;<br />
    zip_eofile = false;<br />
    if (zip_outbuf != null) return;<br />
<br />
    zip_free_queue = zip_qhead = zip_qtail = null;<br />
    zip_outbuf = new Array(zip_OUTBUFSIZ);<br />
    zip_window = new Array(zip_window_size);<br />
    zip_d_buf = new Array(zip_DIST_BUFSIZE);<br />
    zip_l_buf = new Array(zip_INBUFSIZ + zip_INBUF_EXTRA);<br />
    zip_prev = new Array(1 << zip_BITS);<br />
    zip_dyn_ltree = new Array(zip_HEAP_SIZE);<br />
    for (i = 0; i < zip_HEAP_SIZE; i++)<br />
    zip_dyn_ltree<i> = new zip_DeflateCT();<br />
    zip_dyn_dtree = new Array(2 * zip_D_CODES + 1);<br />
    for (i = 0; i < 2 * zip_D_CODES + 1; i++)<br />
    zip_dyn_dtree<i> = new zip_DeflateCT();<br />
    zip_static_ltree = new Array(zip_L_CODES + 2);<br />
    for (i = 0; i < zip_L_CODES + 2; i++)<br />
    zip_static_ltree<i> = new zip_DeflateCT();<br />
    zip_static_dtree = new Array(zip_D_CODES);<br />
    for (i = 0; i < zip_D_CODES; i++)<br />
    zip_static_dtree<i> = new zip_DeflateCT();<br />
    zip_bl_tree = new Array(2 * zip_BL_CODES + 1);<br />
    for (i = 0; i < 2 * zip_BL_CODES + 1; i++)<br />
    zip_bl_tree<i> = new zip_DeflateCT();<br />
    zip_l_desc = new zip_DeflateTreeDesc();<br />
    zip_d_desc = new zip_DeflateTreeDesc();<br />
    zip_bl_desc = new zip_DeflateTreeDesc();<br />
    zip_bl_count = new Array(zip_MAX_BITS + 1);<br />
    zip_heap = new Array(2 * zip_L_CODES + 1);<br />
    zip_depth = new Array(2 * zip_L_CODES + 1);<br />
    zip_length_code = new Array(zip_MAX_MATCH - zip_MIN_MATCH + 1);<br />
    zip_dist_code = new Array(512);<br />
    zip_base_length = new Array(zip_LENGTH_CODES);<br />
    zip_base_dist = new Array(zip_D_CODES);<br />
    zip_flag_buf = new Array(parseInt(zip_LIT_BUFSIZE / 8));<br />
}<br />
<br />
function zip_deflate_end() {<br />
    zip_free_queue = zip_qhead = zip_qtail = null;<br />
    zip_outbuf = null;<br />
    zip_window = null;<br />
    zip_d_buf = null;<br />
    zip_l_buf = null;<br />
    zip_prev = null;<br />
    zip_dyn_ltree = null;<br />
    zip_dyn_dtree = null;<br />
    zip_static_ltree = null;<br />
    zip_static_dtree = null;<br />
    zip_bl_tree = null;<br />
    zip_l_desc = null;<br />
    zip_d_desc = null;<br />
    zip_bl_desc = null;<br />
    zip_bl_count = null;<br />
    zip_heap = null;<br />
    zip_depth = null;<br />
    zip_length_code = null;<br />
    zip_dist_code = null;<br />
    zip_base_length = null;<br />
    zip_base_dist = null;<br />
    zip_flag_buf = null;<br />
}<br />
<br />
function zip_reuse_queue(p) {<br />
    p.next = zip_free_queue;<br />
    zip_free_queue = p;<br />
}<br />
<br />
function zip_new_queue() {<br />
    var p;<br />
<br />
    if (zip_free_queue != null) {<br />
        p = zip_free_queue;<br />
        zip_free_queue = zip_free_queue.next;<br />
    } else p = new zip_DeflateBuffer();<br />
    p.next = null;<br />
    p.len = p.off = 0;<br />
<br />
    return p;<br />
}<br />
<br />
function zip_head1(i) {<br />
    return zip_prev[zip_WSIZE + i];<br />
}<br />
<br />
function zip_head2(i, val) {<br />
    return zip_prev[zip_WSIZE + i] = val;<br />
}<br />
<br />
/* put_byte is used for the compressed output, put_ubyte for the<br />
 * uncompressed output. However unlzw() uses window for its<br />
 * suffix table instead of its output buffer, so it does not use put_ubyte<br />
 * (to be cleaned up).<br />
 */<br />
function zip_put_byte(c) {<br />
    zip_outbuf[zip_outoff + zip_outcnt++] = c;<br />
    if (zip_outoff + zip_outcnt == zip_OUTBUFSIZ) zip_qoutbuf();<br />
}<br />
<br />
/* Output a 16 bit value, lsb first */<br />
function zip_put_short(w) {<br />
    w &= 0xffff;<br />
    if (zip_outoff + zip_outcnt < zip_OUTBUFSIZ - 2) {<br />
        zip_outbuf[zip_outoff + zip_outcnt++] = (w & 0xff);<br />
        zip_outbuf[zip_outoff + zip_outcnt++] = (w >>> 8);<br />
    } else {<br />
        zip_put_byte(w & 0xff);<br />
        zip_put_byte(w >>> 8);<br />
    }<br />
}<br />
<br />
/* ==========================================================================<br />
 * Insert string s in the dictionary and set match_head to the previous head<br />
 * of the hash chain (the most recent string with same hash key). Return<br />
 * the previous length of the hash chain.<br />
 * IN  assertion: all calls to to INSERT_STRING are made with consecutive<br />
 *    input characters and the first MIN_MATCH bytes of s are valid<br />
 *    (except for the last MIN_MATCH-1 bytes of the input file).<br />
 */<br />
function zip_INSERT_STRING() {<br />
    zip_ins_h = ((zip_ins_h << zip_H_SHIFT) ^ (zip_window[zip_strstart + zip_MIN_MATCH - 1] & 0xff)) & zip_HASH_MASK;<br />
    zip_hash_head = zip_head1(zip_ins_h);<br />
    zip_prev[zip_strstart & zip_WMASK] = zip_hash_head;<br />
    zip_head2(zip_ins_h, zip_strstart);<br />
}<br />
<br />
/* Send a code of the given tree. c and tree must not have side effects */<br />
function zip_SEND_CODE(c, tree) {<br />
    zip_send_bits(tree[c].fc, tree[c].dl);<br />
}<br />
<br />
/* Mapping from a distance to a distance code. dist is the distance - 1 and<br />
 * must not have side effects. dist_code[256] and dist_code[257] are never<br />
 * used.<br />
 */<br />
function zip_D_CODE(dist) {<br />
    return (dist < 256 ? zip_dist_code[dist] : zip_dist_code[256 + (dist >> 7)]) & 0xff;<br />
}<br />
<br />
/* ==========================================================================<br />
 * Compares to subtrees, using the tree depth as tie breaker when<br />
 * the subtrees have equal frequency. This minimizes the worst case length.<br />
 */<br />
function zip_SMALLER(tree, n, m) {<br />
    return tree[n].fc < tree[m].fc || (tree[n].fc == tree[m].fc && zip_depth[n] <= zip_depth[m]);<br />
}<br />
<br />
/* ==========================================================================<br />
 * read string data<br />
 */<br />
function zip_read_buff(buff, offset, n) {<br />
    var i;<br />
    for (i = 0; i < n && zip_deflate_pos < zip_deflate_data.length; i++)<br />
    buff[offset + i] = zip_deflate_data.charCodeAt(zip_deflate_pos++) & 0xff;<br />
    return i;<br />
}<br />
<br />
/* ==========================================================================<br />
 * Initialize the "longest match" routines for a new file<br />
 */<br />
function zip_lm_init() {<br />
    var j;<br />
<br />
    /* Initialize the hash table. */<br />
    for (j = 0; j < zip_HASH_SIZE; j++)<br />
    //        zip_head2(j, zip_NIL);<br />
    zip_prev[zip_WSIZE + j] = 0;<br />
    /* prev will be initialized on the fly */<br />
<br />
    /* Set the default configuration parameters:<br />
     */<br />
    zip_max_lazy_match = zip_configuration_table[zip_compr_level].max_lazy;<br />
    zip_good_match = zip_configuration_table[zip_compr_level].good_length;<br />
    if (!zip_FULL_SEARCH) zip_nice_match = zip_configuration_table[zip_compr_level].nice_length;<br />
    zip_max_chain_length = zip_configuration_table[zip_compr_level].max_chain;<br />
<br />
    zip_strstart = 0;<br />
    zip_block_start = 0;<br />
<br />
    zip_lookahead = zip_read_buff(zip_window, 0, 2 * zip_WSIZE);<br />
    if (zip_lookahead <= 0) {<br />
        zip_eofile = true;<br />
        zip_lookahead = 0;<br />
        return;<br />
    }<br />
    zip_eofile = false;<br />
    /* Make sure that we always have enough lookahead. This is important<br />
     * if input comes from a device such as a tty.<br />
     */<br />
    while (zip_lookahead < zip_MIN_LOOKAHEAD && !zip_eofile)<br />
    zip_fill_window();<br />
<br />
    /* If lookahead < MIN_MATCH, ins_h is garbage, but this is<br />
     * not important since only literal bytes will be emitted.<br />
     */<br />

补充内容 (2018-2-15 15:27):
{"user_account":"账号","user_password":"密码","captcha":"验证码"}

补充内容 (2018-2-15 15:28):
调用 b64 方法

秀才遇到兵 · 发表于 2018-2-15 15:27:44

小R软件发表于 2018-2-15 14:35
虽然不知道你用户组怎么来的，大过年的就帮你一下吧；

感谢您的回答，我想要的是下注的那一部分的这个已经弄好了
谢谢！

秀才遇到兵 · 发表于 2018-2-15 15:39:58

Decimal 发表于 2018-2-15 15:27
[e=0]
function b64(data)
{

感谢大神，我不是要登录的，是想要TX分分彩的下注数据，对js不懂，求大神教教

秀才遇到兵 · 发表于 2018-2-15 15:43:07

小白变大神发表于 2018-2-15 15:23
调用方法：encryption('{"user_account":"账号","user_password":"密码","captcha":"验证码"}') 注意引号{: ...

感谢大神，我不是要登录的，是想要TX分分彩的下注数据，对js不懂，求大神教教

Decimal · 发表于 2018-2-15 15:58:06

秀才遇到兵发表于 2018-2-15 15:39
感谢大神，我不是要登录的，是想要TX分分彩的下注数据，对js不懂，求大神教教

应该是一样的js 只不过数据不一样而已看一下他的json 取出来的 data是啥改一下值就好了

		自动登录	找回密码
密码			注册

[已解决] POST 请大神帮忙

最佳答案

评分

点评