本站消息

站长简介/公众号

  出租广告位,需要合作请联系站长


+关注
已关注

分类  

暂无分类

标签  

暂无标签

日期归档  

2024-11(5)

使用 SQL 注入的认证旁路解决方法

发布于2021-05-30 07:51     阅读(1179)     评论(0)     点赞(28)     收藏(4)


使用安全软件对网站扫描后报出“使用 SQL 注入的认证旁路”的漏洞。

此问题跟sql注入有关,首先要确保后台登录请求验证密码时使用参数化查询,不能用sql字符串拼接的形式,sql拼接容易导致注入漏洞。

参数化查询实例:

 

如果这里改成参数化查询后仍报此漏洞,那就可以在前端对密码进行md5加密后传递到后台,后台拿到md5加密后的字符串直接和数据库中的密码进行匹配。

前端md5加密代码实例:

1.添加md5加密的js文件(jquery.md5.js)

  1. /**
  2. * jQuery MD5 hash algorithm function
  3. *
  4. * <code>
  5. * Calculate the md5 hash of a String
  6. * String $.md5 ( String str )
  7. * </code>
  8. *
  9. * Calculates the MD5 hash of str using the » RSA Data Security, Inc. MD5 Message-Digest Algorithm, and returns that hash.
  10. * MD5 (Message-Digest algorithm 5) is a widely-used cryptographic hash function with a 128-bit hash value. MD5 has been employed in a wide variety of security applications, and is also commonly used to check the integrity of data. The generated hash is also non-reversable. Data cannot be retrieved from the message digest, the digest uniquely identifies the data.
  11. * MD5 was developed by Professor Ronald L. Rivest in 1994. Its 128 bit (16 byte) message digest makes it a faster implementation than SHA-1.
  12. * This script is used to process a variable length message into a fixed-length output of 128 bits using the MD5 algorithm. It is fully compatible with UTF-8 encoding. It is very useful when u want to transfer encrypted passwords over the internet. If you plan using UTF-8 encoding in your project don't forget to set the page encoding to UTF-8 (Content-Type meta tag).
  13. * This function orginally get from the WebToolkit and rewrite for using as the jQuery plugin.
  14. *
  15. * Example
  16. * Code
  17. * <code>
  18. * $.md5("I'm Persian.");
  19. * </code>
  20. * Result
  21. * <code>
  22. * "b8c901d0f02223f9761016cfff9d68df"
  23. * </code>
  24. *
  25. * @param {jQuery} {md5:function(string))
  26. * @return string
  27. */
  28. (function ($) {
  29. var rotateLeft = function (lValue, iShiftBits) {
  30. return (lValue << iShiftBits) | (lValue >>> (32 - iShiftBits));
  31. }
  32. var addUnsigned = function (lX, lY) {
  33. var lX4, lY4, lX8, lY8, lResult;
  34. lX8 = (lX & 0x80000000);
  35. lY8 = (lY & 0x80000000);
  36. lX4 = (lX & 0x40000000);
  37. lY4 = (lY & 0x40000000);
  38. lResult = (lX & 0x3FFFFFFF) + (lY & 0x3FFFFFFF);
  39. if (lX4 & lY4) return (lResult ^ 0x80000000 ^ lX8 ^ lY8);
  40. if (lX4 | lY4) {
  41. if (lResult & 0x40000000) return (lResult ^ 0xC0000000 ^ lX8 ^ lY8);
  42. else return (lResult ^ 0x40000000 ^ lX8 ^ lY8);
  43. } else {
  44. return (lResult ^ lX8 ^ lY8);
  45. }
  46. }
  47. var F = function (x, y, z) {
  48. return (x & y) | ((~x) & z);
  49. }
  50. var G = function (x, y, z) {
  51. return (x & z) | (y & (~z));
  52. }
  53. var H = function (x, y, z) {
  54. return (x ^ y ^ z);
  55. }
  56. var I = function (x, y, z) {
  57. return (y ^ (x | (~z)));
  58. }
  59. var FF = function (a, b, c, d, x, s, ac) {
  60. a = addUnsigned(a, addUnsigned(addUnsigned(F(b, c, d), x), ac));
  61. return addUnsigned(rotateLeft(a, s), b);
  62. };
  63. var GG = function (a, b, c, d, x, s, ac) {
  64. a = addUnsigned(a, addUnsigned(addUnsigned(G(b, c, d), x), ac));
  65. return addUnsigned(rotateLeft(a, s), b);
  66. };
  67. var HH = function (a, b, c, d, x, s, ac) {
  68. a = addUnsigned(a, addUnsigned(addUnsigned(H(b, c, d), x), ac));
  69. return addUnsigned(rotateLeft(a, s), b);
  70. };
  71. var II = function (a, b, c, d, x, s, ac) {
  72. a = addUnsigned(a, addUnsigned(addUnsigned(I(b, c, d), x), ac));
  73. return addUnsigned(rotateLeft(a, s), b);
  74. };
  75. var convertToWordArray = function (string) {
  76. var lWordCount;
  77. var lMessageLength = string.length;
  78. var lNumberOfWordsTempOne = lMessageLength + 8;
  79. var lNumberOfWordsTempTwo = (lNumberOfWordsTempOne - (lNumberOfWordsTempOne % 64)) / 64;
  80. var lNumberOfWords = (lNumberOfWordsTempTwo + 1) * 16;
  81. var lWordArray = Array(lNumberOfWords - 1);
  82. var lBytePosition = 0;
  83. var lByteCount = 0;
  84. while (lByteCount < lMessageLength) {
  85. lWordCount = (lByteCount - (lByteCount % 4)) / 4;
  86. lBytePosition = (lByteCount % 4) * 8;
  87. lWordArray[lWordCount] = (lWordArray[lWordCount] | (string.charCodeAt(lByteCount) << lBytePosition));
  88. lByteCount++;
  89. }
  90. lWordCount = (lByteCount - (lByteCount % 4)) / 4;
  91. lBytePosition = (lByteCount % 4) * 8;
  92. lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80 << lBytePosition);
  93. lWordArray[lNumberOfWords - 2] = lMessageLength << 3;
  94. lWordArray[lNumberOfWords - 1] = lMessageLength >>> 29;
  95. return lWordArray;
  96. };
  97. var wordToHex = function (lValue) {
  98. var WordToHexValue = "", WordToHexValueTemp = "", lByte, lCount;
  99. for (lCount = 0; lCount <= 3; lCount++) {
  100. lByte = (lValue >>> (lCount * 8)) & 255;
  101. WordToHexValueTemp = "0" + lByte.toString(16);
  102. WordToHexValue = WordToHexValue + WordToHexValueTemp.substr(WordToHexValueTemp.length - 2, 2);
  103. }
  104. return WordToHexValue;
  105. };
  106. var uTF8Encode = function (string) {
  107. string = string.replace(/\x0d\x0a/g, "\x0a");
  108. var output = "";
  109. for (var n = 0; n < string.length; n++) {
  110. var c = string.charCodeAt(n);
  111. if (c < 128) {
  112. output += String.fromCharCode(c);
  113. } else if ((c > 127) && (c < 2048)) {
  114. output += String.fromCharCode((c >> 6) | 192);
  115. output += String.fromCharCode((c & 63) | 128);
  116. } else {
  117. output += String.fromCharCode((c >> 12) | 224);
  118. output += String.fromCharCode(((c >> 6) & 63) | 128);
  119. output += String.fromCharCode((c & 63) | 128);
  120. }
  121. }
  122. return output;
  123. };
  124. $.extend({
  125. md5: function (string) {
  126. var x = Array();
  127. var k, AA, BB, CC, DD, a, b, c, d;
  128. var S11 = 7, S12 = 12, S13 = 17, S14 = 22;
  129. var S21 = 5, S22 = 9, S23 = 14, S24 = 20;
  130. var S31 = 4, S32 = 11, S33 = 16, S34 = 23;
  131. var S41 = 6, S42 = 10, S43 = 15, S44 = 21;
  132. string = uTF8Encode(string);
  133. x = convertToWordArray(string);
  134. a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476;
  135. for (k = 0; k < x.length; k += 16) {
  136. AA = a; BB = b; CC = c; DD = d;
  137. a = FF(a, b, c, d, x[k + 0], S11, 0xD76AA478);
  138. d = FF(d, a, b, c, x[k + 1], S12, 0xE8C7B756);
  139. c = FF(c, d, a, b, x[k + 2], S13, 0x242070DB);
  140. b = FF(b, c, d, a, x[k + 3], S14, 0xC1BDCEEE);
  141. a = FF(a, b, c, d, x[k + 4], S11, 0xF57C0FAF);
  142. d = FF(d, a, b, c, x[k + 5], S12, 0x4787C62A);
  143. c = FF(c, d, a, b, x[k + 6], S13, 0xA8304613);
  144. b = FF(b, c, d, a, x[k + 7], S14, 0xFD469501);
  145. a = FF(a, b, c, d, x[k + 8], S11, 0x698098D8);
  146. d = FF(d, a, b, c, x[k + 9], S12, 0x8B44F7AF);
  147. c = FF(c, d, a, b, x[k + 10], S13, 0xFFFF5BB1);
  148. b = FF(b, c, d, a, x[k + 11], S14, 0x895CD7BE);
  149. a = FF(a, b, c, d, x[k + 12], S11, 0x6B901122);
  150. d = FF(d, a, b, c, x[k + 13], S12, 0xFD987193);
  151. c = FF(c, d, a, b, x[k + 14], S13, 0xA679438E);
  152. b = FF(b, c, d, a, x[k + 15], S14, 0x49B40821);
  153. a = GG(a, b, c, d, x[k + 1], S21, 0xF61E2562);
  154. d = GG(d, a, b, c, x[k + 6], S22, 0xC040B340);
  155. c = GG(c, d, a, b, x[k + 11], S23, 0x265E5A51);
  156. b = GG(b, c, d, a, x[k + 0], S24, 0xE9B6C7AA);
  157. a = GG(a, b, c, d, x[k + 5], S21, 0xD62F105D);
  158. d = GG(d, a, b, c, x[k + 10], S22, 0x2441453);
  159. c = GG(c, d, a, b, x[k + 15], S23, 0xD8A1E681);
  160. b = GG(b, c, d, a, x[k + 4], S24, 0xE7D3FBC8);
  161. a = GG(a, b, c, d, x[k + 9], S21, 0x21E1CDE6);
  162. d = GG(d, a, b, c, x[k + 14], S22, 0xC33707D6);
  163. c = GG(c, d, a, b, x[k + 3], S23, 0xF4D50D87);
  164. b = GG(b, c, d, a, x[k + 8], S24, 0x455A14ED);
  165. a = GG(a, b, c, d, x[k + 13], S21, 0xA9E3E905);
  166. d = GG(d, a, b, c, x[k + 2], S22, 0xFCEFA3F8);
  167. c = GG(c, d, a, b, x[k + 7], S23, 0x676F02D9);
  168. b = GG(b, c, d, a, x[k + 12], S24, 0x8D2A4C8A);
  169. a = HH(a, b, c, d, x[k + 5], S31, 0xFFFA3942);
  170. d = HH(d, a, b, c, x[k + 8], S32, 0x8771F681);
  171. c = HH(c, d, a, b, x[k + 11], S33, 0x6D9D6122);
  172. b = HH(b, c, d, a, x[k + 14], S34, 0xFDE5380C);
  173. a = HH(a, b, c, d, x[k + 1], S31, 0xA4BEEA44);
  174. d = HH(d, a, b, c, x[k + 4], S32, 0x4BDECFA9);
  175. c = HH(c, d, a, b, x[k + 7], S33, 0xF6BB4B60);
  176. b = HH(b, c, d, a, x[k + 10], S34, 0xBEBFBC70);
  177. a = HH(a, b, c, d, x[k + 13], S31, 0x289B7EC6);
  178. d = HH(d, a, b, c, x[k + 0], S32, 0xEAA127FA);
  179. c = HH(c, d, a, b, x[k + 3], S33, 0xD4EF3085);
  180. b = HH(b, c, d, a, x[k + 6], S34, 0x4881D05);
  181. a = HH(a, b, c, d, x[k + 9], S31, 0xD9D4D039);
  182. d = HH(d, a, b, c, x[k + 12], S32, 0xE6DB99E5);
  183. c = HH(c, d, a, b, x[k + 15], S33, 0x1FA27CF8);
  184. b = HH(b, c, d, a, x[k + 2], S34, 0xC4AC5665);
  185. a = II(a, b, c, d, x[k + 0], S41, 0xF4292244);
  186. d = II(d, a, b, c, x[k + 7], S42, 0x432AFF97);
  187. c = II(c, d, a, b, x[k + 14], S43, 0xAB9423A7);
  188. b = II(b, c, d, a, x[k + 5], S44, 0xFC93A039);
  189. a = II(a, b, c, d, x[k + 12], S41, 0x655B59C3);
  190. d = II(d, a, b, c, x[k + 3], S42, 0x8F0CCC92);
  191. c = II(c, d, a, b, x[k + 10], S43, 0xFFEFF47D);
  192. b = II(b, c, d, a, x[k + 1], S44, 0x85845DD1);
  193. a = II(a, b, c, d, x[k + 8], S41, 0x6FA87E4F);
  194. d = II(d, a, b, c, x[k + 15], S42, 0xFE2CE6E0);
  195. c = II(c, d, a, b, x[k + 6], S43, 0xA3014314);
  196. b = II(b, c, d, a, x[k + 13], S44, 0x4E0811A1);
  197. a = II(a, b, c, d, x[k + 4], S41, 0xF7537E82);
  198. d = II(d, a, b, c, x[k + 11], S42, 0xBD3AF235);
  199. c = II(c, d, a, b, x[k + 2], S43, 0x2AD7D2BB);
  200. b = II(b, c, d, a, x[k + 9], S44, 0xEB86D391);
  201. a = addUnsigned(a, AA);
  202. b = addUnsigned(b, BB);
  203. c = addUnsigned(c, CC);
  204. d = addUnsigned(d, DD);
  205. }
  206. var tempValue = wordToHex(a) + wordToHex(b) + wordToHex(c) + wordToHex(d);
  207. return tempValue.toLowerCase();
  208. }
  209. });
  210. })(jQuery);

2.引用md5加密的js文件

   <script src="Resources/JS/jquery.md5.js"></script>

 3.对密码进行加密处理

HTML代码:

  1. <input class="form-control" id="pw" name="pw" type="password" placeholder="请输入密码"/>

JS代码: 

  var md5Pw=$.md5($("#pw").val());

 

经过上面的几步操作后,传递到后台的密码参数就是经过加密的字符串。

再次用软件进行扫描,发现不再报这个漏洞了。

原文链接:https://blog.csdn.net/liangmengbk/article/details/117367901




所属网站分类: 技术文章 > 博客

作者:小兔崽子

链接:http://www.qianduanheidong.com/blog/article/115915/43c323a84405a52b8ea1/

来源:前端黑洞网

任何形式的转载都请注明出处,如有侵权 一经发现 必将追究其法律责任

28 0
收藏该文
已收藏

评论内容:(最多支持255个字符)