des与3des的javascript实现

比眉伴天荒 2022-03-19 05:07 148阅读 0赞

转自：http://tuhaitao.iteye.com/blog/565531

下面这些源代码统统来自 tero.co.uk 网站。其中包含了 JavaScript 实现按位工作的 DES （数据加密标准）加密算法。它支持 ECB（电子[密码本][Link 1](Electronic Code Book)）和 CBC（密码块链接(Cipher Block Chaining)），并且包含了 3DES 算法，以及我对3des方法的封装，与作者对PKCS7 padding的错误理解做了注释。

function des (key, message, encrypt, mode, iv, padding) {  //declaring this locally speeds things up a bit  var spfunction1 = new Array (0x1010400,0,0x10000,0x1010404,0x1010004,0x10404,0x4,0x10000,0x400,0x1010400,0x1010404,0x400,0x1000404,0x1010004,0x1000000,0x4,0x404,0x1000400,0x1000400,0x10400,0x10400,0x1010000,0x1010000,0x1000404,0x10004,0x1000004,0x1000004,0x10004,0,0x404,0x10404,0x1000000,0x10000,0x1010404,0x4,0x1010000,0x1010400,0x1000000,0x1000000,0x400,0x1010004,0x10000,0x10400,0x1000004,0x400,0x4,0x1000404,0x10404,0x1010404,0x10004,0x1010000,0x1000404,0x1000004,0x404,0x10404,0x1010400,0x404,0x1000400,0x1000400,0,0x10004,0x10400,0,0x1010004);  var spfunction2 = new Array (-0x7fef7fe0,-0x7fff8000,0x8000,0x108020,0x100000,0x20,-0x7fefffe0,-0x7fff7fe0,-0x7fffffe0,-0x7fef7fe0,-0x7fef8000,-0x80000000,-0x7fff8000,0x100000,0x20,-0x7fefffe0,0x108000,0x100020,-0x7fff7fe0,0,-0x80000000,0x8000,0x108020,-0x7ff00000,0x100020,-0x7fffffe0,0,0x108000,0x8020,-0x7fef8000,-0x7ff00000,0x8020,0,0x108020,-0x7fefffe0,0x100000,-0x7fff7fe0,-0x7ff00000,-0x7fef8000,0x8000,-0x7ff00000,-0x7fff8000,0x20,-0x7fef7fe0,0x108020,0x20,0x8000,-0x80000000,0x8020,-0x7fef8000,0x100000,-0x7fffffe0,0x100020,-0x7fff7fe0,-0x7fffffe0,0x100020,0x108000,0,-0x7fff8000,0x8020,-0x80000000,-0x7fefffe0,-0x7fef7fe0,0x108000);  var spfunction3 = new Array (0x208,0x8020200,0,0x8020008,0x8000200,0,0x20208,0x8000200,0x20008,0x8000008,0x8000008,0x20000,0x8020208,0x20008,0x8020000,0x208,0x8000000,0x8,0x8020200,0x200,0x20200,0x8020000,0x8020008,0x20208,0x8000208,0x20200,0x20000,0x8000208,0x8,0x8020208,0x200,0x8000000,0x8020200,0x8000000,0x20008,0x208,0x20000,0x8020200,0x8000200,0,0x200,0x20008,0x8020208,0x8000200,0x8000008,0x200,0,0x8020008,0x8000208,0x20000,0x8000000,0x8020208,0x8,0x20208,0x20200,0x8000008,0x8020000,0x8000208,0x208,0x8020000,0x20208,0x8,0x8020008,0x20200);  var spfunction4 = new Array (0x802001,0x2081,0x2081,0x80,0x802080,0x800081,0x800001,0x2001,0,0x802000,0x802000,0x802081,0x81,0,0x800080,0x800001,0x1,0x2000,0x800000,0x802001,0x80,0x800000,0x2001,0x2080,0x800081,0x1,0x2080,0x800080,0x2000,0x802080,0x802081,0x81,0x800080,0x800001,0x802000,0x802081,0x81,0,0,0x802000,0x2080,0x800080,0x800081,0x1,0x802001,0x2081,0x2081,0x80,0x802081,0x81,0x1,0x2000,0x800001,0x2001,0x802080,0x800081,0x2001,0x2080,0x800000,0x802001,0x80,0x800000,0x2000,0x802080);  var spfunction5 = new Array (0x100,0x2080100,0x2080000,0x42000100,0x80000,0x100,0x40000000,0x2080000,0x40080100,0x80000,0x2000100,0x40080100,0x42000100,0x42080000,0x80100,0x40000000,0x2000000,0x40080000,0x40080000,0,0x40000100,0x42080100,0x42080100,0x2000100,0x42080000,0x40000100,0,0x42000000,0x2080100,0x2000000,0x42000000,0x80100,0x80000,0x42000100,0x100,0x2000000,0x40000000,0x2080000,0x42000100,0x40080100,0x2000100,0x40000000,0x42080000,0x2080100,0x40080100,0x100,0x2000000,0x42080000,0x42080100,0x80100,0x42000000,0x42080100,0x2080000,0,0x40080000,0x42000000,0x80100,0x2000100,0x40000100,0x80000,0,0x40080000,0x2080100,0x40000100);  var spfunction6 = new Array (0x20000010,0x20400000,0x4000,0x20404010,0x20400000,0x10,0x20404010,0x400000,0x20004000,0x404010,0x400000,0x20000010,0x400010,0x20004000,0x20000000,0x4010,0,0x400010,0x20004010,0x4000,0x404000,0x20004010,0x10,0x20400010,0x20400010,0,0x404010,0x20404000,0x4010,0x404000,0x20404000,0x20000000,0x20004000,0x10,0x20400010,0x404000,0x20404010,0x400000,0x4010,0x20000010,0x400000,0x20004000,0x20000000,0x4010,0x20000010,0x20404010,0x404000,0x20400000,0x404010,0x20404000,0,0x20400010,0x10,0x4000,0x20400000,0x404010,0x4000,0x400010,0x20004010,0,0x20404000,0x20000000,0x400010,0x20004010);  var spfunction7 = new Array (0x200000,0x4200002,0x4000802,0,0x800,0x4000802,0x200802,0x4200800,0x4200802,0x200000,0,0x4000002,0x2,0x4000000,0x4200002,0x802,0x4000800,0x200802,0x200002,0x4000800,0x4000002,0x4200000,0x4200800,0x200002,0x4200000,0x800,0x802,0x4200802,0x200800,0x2,0x4000000,0x200800,0x4000000,0x200800,0x200000,0x4000802,0x4000802,0x4200002,0x4200002,0x2,0x200002,0x4000000,0x4000800,0x200000,0x4200800,0x802,0x200802,0x4200800,0x802,0x4000002,0x4200802,0x4200000,0x200800,0,0x2,0x4200802,0,0x200802,0x4200000,0x800,0x4000002,0x4000800,0x800,0x200002);  var spfunction8 = new Array (0x10001040,0x1000,0x40000,0x10041040,0x10000000,0x10001040,0x40,0x10000000,0x40040,0x10040000,0x10041040,0x41000,0x10041000,0x41040,0x1000,0x40,0x10040000,0x10000040,0x10001000,0x1040,0x41000,0x40040,0x10040040,0x10041000,0x1040,0,0,0x10040040,0x10000040,0x10001000,0x41040,0x40000,0x41040,0x40000,0x10041000,0x1000,0x40,0x10040040,0x1000,0x41040,0x10001000,0x40,0x10000040,0x10040000,0x10040040,0x10000000,0x40000,0x10001040,0,0x10041040,0x40040,0x10000040,0x10040000,0x10001000,0x10001040,0,0x10041040,0x41000,0x41000,0x1040,0x1040,0x40040,0x10000000,0x10041000);  //create the 16 or 48 subkeys we will need  var keys = des_createKeys (key);  var m=0, i, j, temp, temp2, right1, right2, left, right, looping;  var cbcleft, cbcleft2, cbcright, cbcright2  var endloop, loopinc;  var len = message.length;  var chunk = 0;  //set up the loops for single and triple des  var iterations = keys.length == 32 ? 3 : 9; //single or triple des  if (iterations == 3) {    looping = encrypt ? new Array (0, 32, 2) : new Array (30, -2, -2);  }  else {    looping = encrypt ? new Array (0, 32, 2, 62, 30, -2, 64, 96, 2) : new Array (94, 62, -2, 32, 64, 2, 30, -2, -2);  }  //pad the message depending on the padding parameter  if (padding == 2)     message += "        "; //pad the message with spaces  else if (padding == 1) {    temp = 8-(len%8); message += String.fromCharCode (temp,temp,temp,temp,temp,temp,temp,temp);    if (temp==8)      len+=8;  } //PKCS7 padding 这里其实只是PKCS5 padding, PKCS5规定采用8位补全，而PKCS7则不确定位数  else if (!padding)     message += "\0\0\0\0\0\0\0\0"; //pad the message out with null bytes  //store the result here  result = "";  tempresult = "";  if (mode == 1) { //CBC mode    cbcleft = (iv.charCodeAt(m++) << 24) | (iv.charCodeAt(m++) << 16) | (iv.charCodeAt(m++) << 8) | iv.charCodeAt(m++);    cbcright = (iv.charCodeAt(m++) << 24) | (iv.charCodeAt(m++) << 16) | (iv.charCodeAt(m++) << 8) | iv.charCodeAt(m++);    m=0;  }  //loop through each 64 bit chunk of the message  while (m < len) {    left = (message.charCodeAt(m++) << 24) | (message.charCodeAt(m++) << 16) | (message.charCodeAt(m++) << 8) | message.charCodeAt(m++);    right = (message.charCodeAt(m++) << 24) | (message.charCodeAt(m++) << 16) | (message.charCodeAt(m++) << 8) | message.charCodeAt(m++);    //for Cipher Block Chaining mode, xor the message with the previous result    if (mode == 1) {
        if (encrypt) {left ^= cbcleft; right ^= cbcright;} else {cbcleft2 = cbcleft; cbcright2 = cbcright; cbcleft = left; cbcright = right;}}    //first each 64 but chunk of the message must be permuted according to IP    temp = ((left >>> 4) ^ right) & 0x0f0f0f0f; right ^= temp; left ^= (temp << 4);    temp = ((left >>> 16) ^ right) & 0x0000ffff; right ^= temp; left ^= (temp << 16);    temp = ((right >>> 2) ^ left) & 0x33333333; left ^= temp; right ^= (temp << 2);    temp = ((right >>> 8) ^ left) & 0x00ff00ff; left ^= temp; right ^= (temp << 8);    temp = ((left >>> 1) ^ right) & 0x55555555; right ^= temp; left ^= (temp << 1);    left = ((left << 1) | (left >>> 31));     right = ((right << 1) | (right >>> 31));     //do this either 1 or 3 times for each chunk of the message    for (j=0; j<iterations; j+=3) {      endloop = looping[j+1];      loopinc = looping[j+2];      //now go through and perform the encryption or decryption        for (i=looping[j]; i!=endloop; i+=loopinc) { //for efficiency        right1 = right ^ keys[i];         right2 = ((right >>> 4) | (right << 28)) ^ keys[i+1];        //the result is attained by passing these bytes through the S selection functions        temp = left;        left = right;        right = temp ^ (spfunction2[(right1 >>> 24) & 0x3f] | spfunction4[(right1 >>> 16) & 0x3f]              | spfunction6[(right1 >>>  8) & 0x3f] | spfunction8[right1 & 0x3f]              | spfunction1[(right2 >>> 24) & 0x3f] | spfunction3[(right2 >>> 16) & 0x3f]              | spfunction5[(right2 >>>  8) & 0x3f] | spfunction7[right2 & 0x3f]);      }      temp = left; left = right; right = temp; //unreverse left and right    } //for either 1 or 3 iterations    //move then each one bit to the right    left = ((left >>> 1) | (left << 31));     right = ((right >>> 1) | (right << 31));     //now perform IP-1, which is IP in the opposite direction    temp = ((left >>> 1) ^ right) & 0x55555555; right ^= temp; left ^= (temp << 1);    temp = ((right >>> 8) ^ left) & 0x00ff00ff; left ^= temp; right ^= (temp << 8);    temp = ((right >>> 2) ^ left) & 0x33333333; left ^= temp; right ^= (temp << 2);    temp = ((left >>> 16) ^ right) & 0x0000ffff; right ^= temp; left ^= (temp << 16);    temp = ((left >>> 4) ^ right) & 0x0f0f0f0f; right ^= temp; left ^= (temp << 4);    //for Cipher Block Chaining mode, xor the message with the previous result    if (mode == 1) {
        if (encrypt) {cbcleft = left; cbcright = right;} else {left ^= cbcleft2; right ^= cbcright2;}}    tempresult += String.fromCharCode ((left>>>24), ((left>>>16) & 0xff), ((left>>>8) & 0xff), (left & 0xff), (right>>>24), ((right>>>16) & 0xff), ((right>>>8) & 0xff), (right & 0xff));    chunk += 8;    if (chunk == 512) {result += tempresult; tempresult = ""; chunk = 0;}  } //for every 8 characters, or 64 bits in the message  //return the result as an array  return result + tempresult;} //end of des//des_createKeys//this takes as input a 64 bit key (even though only 56 bits are used)//as an array of 2 integers, and returns 16 48 bit keysfunction des_createKeys (key) {  //declaring this locally speeds things up a bit  pc2bytes0  = new Array (0,0x4,0x20000000,0x20000004,0x10000,0x10004,0x20010000,0x20010004,0x200,0x204,0x20000200,0x20000204,0x10200,0x10204,0x20010200,0x20010204);  pc2bytes1  = new Array (0,0x1,0x100000,0x100001,0x4000000,0x4000001,0x4100000,0x4100001,0x100,0x101,0x100100,0x100101,0x4000100,0x4000101,0x4100100,0x4100101);  pc2bytes2  = new Array (0,0x8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808,0,0x8,0x800,0x808,0x1000000,0x1000008,0x1000800,0x1000808);  pc2bytes3  = new Array (0,0x200000,0x8000000,0x8200000,0x2000,0x202000,0x8002000,0x8202000,0x20000,0x220000,0x8020000,0x8220000,0x22000,0x222000,0x8022000,0x8222000);  pc2bytes4  = new Array (0,0x40000,0x10,0x40010,0,0x40000,0x10,0x40010,0x1000,0x41000,0x1010,0x41010,0x1000,0x41000,0x1010,0x41010);  pc2bytes5  = new Array (0,0x400,0x20,0x420,0,0x400,0x20,0x420,0x2000000,0x2000400,0x2000020,0x2000420,0x2000000,0x2000400,0x2000020,0x2000420);  pc2bytes6  = new Array (0,0x10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002,0,0x10000000,0x80000,0x10080000,0x2,0x10000002,0x80002,0x10080002);  pc2bytes7  = new Array (0,0x10000,0x800,0x10800,0x20000000,0x20010000,0x20000800,0x20010800,0x20000,0x30000,0x20800,0x30800,0x20020000,0x20030000,0x20020800,0x20030800);  pc2bytes8  = new Array (0,0x40000,0,0x40000,0x2,0x40002,0x2,0x40002,0x2000000,0x2040000,0x2000000,0x2040000,0x2000002,0x2040002,0x2000002,0x2040002);  pc2bytes9  = new Array (0,0x10000000,0x8,0x10000008,0,0x10000000,0x8,0x10000008,0x400,0x10000400,0x408,0x10000408,0x400,0x10000400,0x408,0x10000408);  pc2bytes10 = new Array (0,0x20,0,0x20,0x100000,0x100020,0x100000,0x100020,0x2000,0x2020,0x2000,0x2020,0x102000,0x102020,0x102000,0x102020);  pc2bytes11 = new Array (0,0x1000000,0x200,0x1000200,0x200000,0x1200000,0x200200,0x1200200,0x4000000,0x5000000,0x4000200,0x5000200,0x4200000,0x5200000,0x4200200,0x5200200);  pc2bytes12 = new Array (0,0x1000,0x8000000,0x8001000,0x80000,0x81000,0x8080000,0x8081000,0x10,0x1010,0x8000010,0x8001010,0x80010,0x81010,0x8080010,0x8081010);  pc2bytes13 = new Array (0,0x4,0x100,0x104,0,0x4,0x100,0x104,0x1,0x5,0x101,0x105,0x1,0x5,0x101,0x105);  //how many iterations (1 for des, 3 for triple des)  var iterations = key.length > 8 ? 3 : 1;   //stores the return keys  var keys = new Array (32 * iterations);  //now define the left shifts which need to be done  var shifts = new Array (0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0);  //other variables  var lefttemp, righttemp, m=0, n=0, temp;  for (var j=0; j<iterations; j++) { //either 1 or 3 iterations    left = (key.charCodeAt(m++) << 24) | (key.charCodeAt(m++) << 16) | (key.charCodeAt(m++) << 8) | key.charCodeAt(m++);    right = (key.charCodeAt(m++) << 24) | (key.charCodeAt(m++) << 16) | (key.charCodeAt(m++) << 8) | key.charCodeAt(m++);    temp = ((left >>> 4) ^ right) & 0x0f0f0f0f; right ^= temp; left ^= (temp << 4);    temp = ((right >>> -16) ^ left) & 0x0000ffff; left ^= temp; right ^= (temp << -16);    temp = ((left >>> 2) ^ right) & 0x33333333; right ^= temp; left ^= (temp << 2);    temp = ((right >>> -16) ^ left) & 0x0000ffff; left ^= temp; right ^= (temp << -16);    temp = ((left >>> 1) ^ right) & 0x55555555; right ^= temp; left ^= (temp << 1);    temp = ((right >>> 8) ^ left) & 0x00ff00ff; left ^= temp; right ^= (temp << 8);    temp = ((left >>> 1) ^ right) & 0x55555555; right ^= temp; left ^= (temp << 1);    //the right side needs to be shifted and to get the last four bits of the left side    temp = (left << 8) | ((right >>> 20) & 0x000000f0);    //left needs to be put upside down    left = (right << 24) | ((right << 8) & 0xff0000) | ((right >>> 8) & 0xff00) | ((right >>> 24) & 0xf0);    right = temp;    //now go through and perform these shifts on the left and right keys    for (var i=0; i < shifts.length; i++) {      //shift the keys either one or two bits to the left      if (shifts[i]) {left = (left << 2) | (left >>> 26); right = (right << 2) | (right >>> 26);}      else {left = (left << 1) | (left >>> 27); right = (right << 1) | (right >>> 27);}      left &= -0xf; right &= -0xf;      //now apply PC-2, in such a way that E is easier when encrypting or decrypting      //this conversion will look like PC-2 except only the last 6 bits of each byte are used      //rather than 48 consecutive bits and the order of lines will be according to       //how the S selection functions will be applied: S2, S4, S6, S8, S1, S3, S5, S7      lefttemp = pc2bytes0[left >>> 28] | pc2bytes1[(left >>> 24) & 0xf]              | pc2bytes2[(left >>> 20) & 0xf] | pc2bytes3[(left >>> 16) & 0xf]              | pc2bytes4[(left >>> 12) & 0xf] | pc2bytes5[(left >>> 8) & 0xf]              | pc2bytes6[(left >>> 4) & 0xf];      righttemp = pc2bytes7[right >>> 28] | pc2bytes8[(right >>> 24) & 0xf]                | pc2bytes9[(right >>> 20) & 0xf] | pc2bytes10[(right >>> 16) & 0xf]                | pc2bytes11[(right >>> 12) & 0xf] | pc2bytes12[(right >>> 8) & 0xf]                | pc2bytes13[(right >>> 4) & 0xf];      temp = ((righttemp >>> 16) ^ lefttemp) & 0x0000ffff;       keys[n++] = lefttemp ^ temp; keys[n++] = righttemp ^ (temp << 16);    }  } //for each iterations  //return the keys we've created  return keys;} //end of des_createKeys// TEST //function stringToHex (s) {  var r = "";//这里本来有0x,我去掉了，需要的朋友自己加  var hexes = new Array ("0","1","2","3","4","5","6","7","8","9","A","B","C","D","E","F");  for (var i=0; i<s.length; i++) {r += hexes [s.charCodeAt(i) >> 4] + hexes [s.charCodeAt(i) & 0xf];}  return r;}

该函数接受一个 8 字节字符串作为普通 DES 算法的密钥（也就是 64 位，但是算法只使用 56 位），或者接受一个 24 字节字符串作为 3DES 算法的密钥；第二个参数是要加密或解密的信息字符串；第三个布尔值参数用来说明信息是加密还是解密；接下来的可选参数 mode 如果是 0 表示 ECB 模式，1 表示 CBC 模式，默认是 ECB 模式；最后一个可选项是一个 8 字节的输入向量字符串（在 ECB 模式下不使用）。返回的密文是字符串。  
  
这里我封装了一个3des的方法，根据3des的规定，key必须为24字节,所以如果传入的key不够24字节，需要自己补全，补全的规则是低位补0；

function triple_des(key, message) {    for (var i = key.length; i<24; i++) { key+="0";    }    return des(key, message, 1, 0, 0, 1);}// 这里因为3des与des方法转换出来的是字节，需要用上边的stringToHex转换成字符alert(stringToHex(triple_des("key", "hello123")));

再分享一下我老师大神的人工智能教程吧。零基础！通俗易懂！风趣幽默！还带黄段子！希望你也加入到我们人工智能的队伍中来！[https://blog.csdn.net/jiangjunshow][https_blog.csdn.net_jiangjunshow]

[Link 1]: https://www.baidu.com/s?wd=%E5%AF%86%E7%A0%81%E6%9C%AC&tn=24004469_oem_dg&rsv_dl=gh_pl_sl_csd
[https_blog.csdn.net_jiangjunshow]: https://blog.csdn.net/jiangjunshow/article/details/77338485

发表评论取消回复

表情：

评论列表（有 0 条评论，148人围观）

还没有评论，来说两句吧...

相关阅读

相关 des、3des加密算法_数据加密标准（DES）算法

![158dd3ead192d409d826b784c6643e31.png][] des、3des加密算法 Data Encryption Standard is a s

悠悠/ 2022年12月07日 13:16/ 0 赞/ 271 阅读

相关 3des des java_JAVA加密算法（3）- 对称加密算法（DES、3DES、AES）

对称加密算法概念加密密钥和解密密钥相同，大部分算法加密揭秘过程互逆。特点：算法公开、(相比非对称加密)计算量小、加密速度快、效率高。弱点：双方都使用同样的密钥，安全

矫情吗；*/ 2022年11月02日 00:58/ 0 赞/ 235 阅读

相关 Go-Des和3Des算法详解与代码

目录 Des 发展史分组密码算法设计思想 Des概述初始置换与逆置换 Feistel结构轮函数F E扩展密钥加 S盒代换 P置换密钥编排 3

雨点打透心脏的1/2处/ 2022年10月17日 14:00/ 0 赞/ 170 阅读

相关对称密码的编程使用（DES、3DES、AES）

对称密码的概念加密密钥和解密密钥相同，对于大多数对称密码算法，加解密过程互逆加解密通信模型 ![Center][] 特点：算法公开、

逃离我推掉我的手/ 2022年09月28日 14:25/ 0 赞/ 156 阅读

相关 3DES(DESede、Triple-DES、DES-EDE) 加解密 C#

对称加密(DES、3DES)、非对称加密(RSA、SHA1withRSA) 参考: [https://blog.csdn.net/sinat\_16998945/artic

痛定思痛。/ 2022年09月08日 04:59/ 0 赞/ 193 阅读

相关 3DES(DESede、Triple-DES、DES-EDE) 加解密 JAVA

对称加密(DES、3DES)、非对称加密(RSA、SHA1withRSA) 参考: [https://blog.csdn.net/sinat\_16998945/artic

我不是女神ヾ/ 2022年09月07日 15:59/ 0 赞/ 206 阅读

相关 DES & 3DES

DES是美国1977-1998年数据加密标准 DES(Data Encryption Standard)数据加密标准算法,采用56bits密钥加密64bits数据成密文的

柔光的暖阳◎/ 2022年05月08日 01:20/ 0 赞/ 153 阅读

相关 DES3加密

Des3加密算法是一种对称加密算法。 public class DES3 { / 加密 @para

本是古典何须时尚/ 2022年04月24日 11:14/ 0 赞/ 202 阅读

相关 des与3des的javascript实现

转自：http://tuhaitao.iteye.com/blog/565531 下面这些源代码统统来自 tero.co.uk 网站。其中包含了 JavaScript 实现按

比眉伴天荒/ 2022年03月19日 05:07/ 0 赞/ 149 阅读

相关 Des与3Des加密解密

/// <summary> /// Des和3Des算法 /// </summary> public class Des

蔚落/ 2021年12月01日 15:38/ 0 赞/ 448 阅读