jmeter对请求参数的签名处理
1.首先在本地写好签名的算法,本文采用RSA签名。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 | public final class Base64 { static private final int BASELENGTH = 128 ; static private final int LOOKUPLENGTH = 64 ; static private final int TWENTYFOURBITGROUP = 24 ; static private final int EIGHTBIT = 8 ; static private final int SIXTEENBIT = 16 ; static private final int FOURBYTE = 4 ; static private final int SIGN = - 128 ; static private final char PAD = '=' ; static private final boolean fDebug = false ; static final private byte [] base64Alphabet = new byte [BASELENGTH]; static final private char [] lookUpBase64Alphabet = new char [LOOKUPLENGTH]; static { for ( int i = 0 ; i < BASELENGTH; ++i) { base64Alphabet[i] = - 1 ; } for ( int i = 'Z' ; i >= 'A' ; i--) { base64Alphabet[i] = ( byte ) (i - 'A' ); } for ( int i = 'z' ; i >= 'a' ; i--) { base64Alphabet[i] = ( byte ) (i - 'a' + 26 ); } for ( int i = '9' ; i >= '0' ; i--) { base64Alphabet[i] = ( byte ) (i - '0' + 52 ); } base64Alphabet[ '+' ] = 62 ; base64Alphabet[ '/' ] = 63 ; for ( int i = 0 ; i <= 25 ; i++) { lookUpBase64Alphabet[i] = ( char ) ( 'A' + i); } for ( int i = 26 , j = 0 ; i <= 51 ; i++, j++) { lookUpBase64Alphabet[i] = ( char ) ( 'a' + j); } for ( int i = 52 , j = 0 ; i <= 61 ; i++, j++) { lookUpBase64Alphabet[i] = ( char ) ( '0' + j); } lookUpBase64Alphabet[ 62 ] = ( char ) '+' ; lookUpBase64Alphabet[ 63 ] = ( char ) '/' ; } private static boolean isWhiteSpace( char octect) { return (octect == 0x20 || octect == 0xd || octect == 0xa || octect == 0x9 ); } private static boolean isPad( char octect) { return (octect == PAD); } private static boolean isData( char octect) { return (octect < BASELENGTH && base64Alphabet[octect] != - 1 ); } /** * Encodes hex octects into Base64 * * @param binaryData Array containing binaryData * @return Encoded Base64 array */ public static String encode( byte [] binaryData) { if (binaryData == null ) { return null ; } int lengthDataBits = binaryData.length * EIGHTBIT; if (lengthDataBits == 0 ) { return "" ; } int fewerThan24bits = lengthDataBits % TWENTYFOURBITGROUP; int numberTriplets = lengthDataBits / TWENTYFOURBITGROUP; int numberQuartet = fewerThan24bits != 0 ? numberTriplets + 1 : numberTriplets; char encodedData[] = null ; encodedData = new char [numberQuartet * 4 ]; byte k = 0 , l = 0 , b1 = 0 , b2 = 0 , b3 = 0 ; int encodedIndex = 0 ; int dataIndex = 0 ; if (fDebug) { System.out.println( "number of triplets = " + numberTriplets); } for ( int i = 0 ; i < numberTriplets; i++) { b1 = binaryData[dataIndex++]; b2 = binaryData[dataIndex++]; b3 = binaryData[dataIndex++]; if (fDebug) { System.out.println( "b1= " + b1 + ", b2= " + b2 + ", b3= " + b3); } l = ( byte ) (b2 & 0x0f ); k = ( byte ) (b1 & 0x03 ); byte val1 = ((b1 & SIGN) == 0 ) ? ( byte ) (b1 >> 2 ) : ( byte ) ((b1) >> 2 ^ 0xc0 ); byte val2 = ((b2 & SIGN) == 0 ) ? ( byte ) (b2 >> 4 ) : ( byte ) ((b2) >> 4 ^ 0xf0 ); byte val3 = ((b3 & SIGN) == 0 ) ? ( byte ) (b3 >> 6 ) : ( byte ) ((b3) >> 6 ^ 0xfc ); if (fDebug) { System.out.println( "val2 = " + val2); System.out.println( "k4 = " + (k << 4 )); System.out.println( "vak = " + (val2 | (k << 4 ))); } encodedData[encodedIndex++] = lookUpBase64Alphabet[val1]; encodedData[encodedIndex++] = lookUpBase64Alphabet[val2 | (k << 4 )]; encodedData[encodedIndex++] = lookUpBase64Alphabet[(l << 2 ) | val3]; encodedData[encodedIndex++] = lookUpBase64Alphabet[b3 & 0x3f ]; } // form integral number of 6-bit groups if (fewerThan24bits == EIGHTBIT) { b1 = binaryData[dataIndex]; k = ( byte ) (b1 & 0x03 ); if (fDebug) { System.out.println( "b1=" + b1); System.out.println( "b1<<2 = " + (b1 >> 2 )); } byte val1 = ((b1 & SIGN) == 0 ) ? ( byte ) (b1 >> 2 ) : ( byte ) ((b1) >> 2 ^ 0xc0 ); encodedData[encodedIndex++] = lookUpBase64Alphabet[val1]; encodedData[encodedIndex++] = lookUpBase64Alphabet[k << 4 ]; encodedData[encodedIndex++] = PAD; encodedData[encodedIndex++] = PAD; } else if (fewerThan24bits == SIXTEENBIT) { b1 = binaryData[dataIndex]; b2 = binaryData[dataIndex + 1 ]; l = ( byte ) (b2 & 0x0f ); k = ( byte ) (b1 & 0x03 ); byte val1 = ((b1 & SIGN) == 0 ) ? ( byte ) (b1 >> 2 ) : ( byte ) ((b1) >> 2 ^ 0xc0 ); byte val2 = ((b2 & SIGN) == 0 ) ? ( byte ) (b2 >> 4 ) : ( byte ) ((b2) >> 4 ^ 0xf0 ); encodedData[encodedIndex++] = lookUpBase64Alphabet[val1]; encodedData[encodedIndex++] = lookUpBase64Alphabet[val2 | (k << 4 )]; encodedData[encodedIndex++] = lookUpBase64Alphabet[l << 2 ]; encodedData[encodedIndex++] = PAD; } return new String(encodedData); } /** * Decodes Base64 data into octects * * @param encoded string containing Base64 data * @return Array containind decoded data. */ public static byte [] decode(String encoded) { if (encoded == null ) { return null ; } char [] base64Data = encoded.toCharArray(); // remove white spaces int len = removeWhiteSpace(base64Data); if (len % FOURBYTE != 0 ) { return null ; //should be divisible by four } int numberQuadruple = (len / FOURBYTE); if (numberQuadruple == 0 ) { return new byte [ 0 ]; } byte decodedData[] = null ; byte b1 = 0 , b2 = 0 , b3 = 0 , b4 = 0 ; char d1 = 0 , d2 = 0 , d3 = 0 , d4 = 0 ; int i = 0 ; int encodedIndex = 0 ; int dataIndex = 0 ; decodedData = new byte [(numberQuadruple) * 3 ]; for (; i < numberQuadruple - 1 ; i++) { if (!isData((d1 = base64Data[dataIndex++])) || !isData((d2 = base64Data[dataIndex++])) || !isData((d3 = base64Data[dataIndex++])) || !isData((d4 = base64Data[dataIndex++]))) { return null ; } //if found "no data" just return null b1 = base64Alphabet[d1]; b2 = base64Alphabet[d2]; b3 = base64Alphabet[d3]; b4 = base64Alphabet[d4]; decodedData[encodedIndex++] = ( byte ) (b1 << 2 | b2 >> 4 ); decodedData[encodedIndex++] = ( byte ) (((b2 & 0xf ) << 4 ) | ((b3 >> 2 ) & 0xf )); decodedData[encodedIndex++] = ( byte ) (b3 << 6 | b4); } if (!isData((d1 = base64Data[dataIndex++])) || !isData((d2 = base64Data[dataIndex++]))) { return null ; //if found "no data" just return null } b1 = base64Alphabet[d1]; b2 = base64Alphabet[d2]; d3 = base64Data[dataIndex++]; d4 = base64Data[dataIndex++]; if (!isData((d3)) || !isData((d4))) { //Check if they are PAD characters if (isPad(d3) && isPad(d4)) { if ((b2 & 0xf ) != 0 ) //last 4 bits should be zero { return null ; } byte [] tmp = new byte [i * 3 + 1 ]; System.arraycopy(decodedData, 0 , tmp, 0 , i * 3 ); tmp[encodedIndex] = ( byte ) (b1 << 2 | b2 >> 4 ); return tmp; } else if (!isPad(d3) && isPad(d4)) { b3 = base64Alphabet[d3]; if ((b3 & 0x3 ) != 0 ) //last 2 bits should be zero { return null ; } byte [] tmp = new byte [i * 3 + 2 ]; System.arraycopy(decodedData, 0 , tmp, 0 , i * 3 ); tmp[encodedIndex++] = ( byte ) (b1 << 2 | b2 >> 4 ); tmp[encodedIndex] = ( byte ) (((b2 & 0xf ) << 4 ) | ((b3 >> 2 ) & 0xf )); return tmp; } else { return null ; } } else { //No PAD e.g 3cQl b3 = base64Alphabet[d3]; b4 = base64Alphabet[d4]; decodedData[encodedIndex++] = ( byte ) (b1 << 2 | b2 >> 4 ); decodedData[encodedIndex++] = ( byte ) (((b2 & 0xf ) << 4 ) | ((b3 >> 2 ) & 0xf )); decodedData[encodedIndex++] = ( byte ) (b3 << 6 | b4); } return decodedData; } /** * remove WhiteSpace from MIME containing encoded Base64 data. * * @param data the byte array of base64 data (with WS) * @return the new length */ private static int removeWhiteSpace( char [] data) { if (data == null ) { return 0 ; } // count characters that's not whitespace int newSize = 0 ; int len = data.length; for ( int i = 0 ; i < len; i++) { if (!isWhiteSpace(data[i])) { data[newSize++] = data[i]; } } return newSize; } } |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 | import java.security.KeyFactory; import java.security.PrivateKey; import java.security.PublicKey; import java.security.spec.PKCS8EncodedKeySpec; import java.security.spec.X509EncodedKeySpec; public class RSA { private static final String SIGN_ALGORITHMS = "MD5WithRSA" ; /** * RSA验签名检查 * @param content 待签名数据 * @param sign 签名值 * @param ali_public_key 爱贝公钥 * @param input_charset 编码格式 * @return 布尔值 */ public static boolean verify(String content, String sign, String iapp_pub_key, String input_charset) { try { KeyFactory keyFactory = KeyFactory.getInstance( "RSA" ); byte [] encodedKey = Base64.decode(iapp_pub_key); PublicKey pubKey = keyFactory.generatePublic( new X509EncodedKeySpec(encodedKey)); java.security.Signature signature = java.security.Signature .getInstance(SIGN_ALGORITHMS); signature.initVerify(pubKey); signature.update( content.getBytes(input_charset) ); return signature.verify( Base64.decode(sign) ); } catch (Exception e) { e.printStackTrace(); } return false ; } /** * RSA签名 * @param content 待签名数据 * @param privateKey 商户私钥 * @param input_charset 编码格式 * @return 签名值 */ public static String sign(String content, String privateKey, String input_charset) { try { PKCS8EncodedKeySpec priPKCS8 = new PKCS8EncodedKeySpec( Base64.decode(privateKey) ); KeyFactory keyf = KeyFactory.getInstance( "RSA" ); PrivateKey priKey = keyf.generatePrivate(priPKCS8); java.security.Signature signature = java.security.Signature .getInstance(SIGN_ALGORITHMS); signature.initSign(priKey); signature.update( content.getBytes(input_charset) ); byte [] signed = signature.sign(); return Base64.encode(signed); } catch (Exception e) { e.printStackTrace(); } return null ; } } |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 | package com.zyzxpay.sign; public class SignHelper { // 字符编码格式 ,目前支持 utf-8 public static String input_charset = "utf-8" ; public static boolean verify(String content, String sign, String pubKey) { // 目前版本,只支持RSA return RSA.verify(content, sign, pubKey, input_charset); } public static String sign(String content, String privateKey) { return RSA.sign(content, privateKey, input_charset); } } |
2.将以上3个类生成jar包,在jmeter的计划中引入。
3. 添加http请求,并在该请求下添加用户变量,存储我们用来签名的数据,也可用上个接口的响应结果存储起来作为要签名的数据。
在http请求的参数中,引用变量${content}
4.在http请求下添加BeanShell PreProcessor,处理签名的参数,并存在sign中供http请求调用,先导入签名类:import com.paydela.*;
1 2 3 4 5 6 7 8 | import com.paydela.*; System.out.println(vars.get( "content" )); System.out.println(vars.get( "aaa" )); String content =vars.get( "content" ); String result = SignHelper.sign(content, "" ); System.out.println(result); vars.put( "sign" ,result); |
5. 在http请求中用${sign}来引用签名后的数据
6. 在http请求下添加BeanShell PostProcessor,用来处理响应结果
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 | import java.io.UnsupportedEncodingException; System.out.println(prev.getResponseCode()); String str = prev.getResponseDataAsString(); /* String result = ${__urldecode(str)}; System.out.println("------------"+result); */ String result = "" ; try { result = java.net.URLDecoder.decode(str, "UTF-8" ); } catch (UnsupportedEncodingException e) { e.printStackTrace(); } System.out.println( "result:" +result); vars.put( "result" ,result); |
7.添加结果树、debug等,运行后便可以看到签名的请求数据以及响应结果
******************************************************************************************************************************************
作者:乔叶叶
博客地址:http://www.cnblogs.com/qiaoyeye/
本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文连接,否则保留追究法律责任的权利。
******************************************************************************************************************************************
作者:乔叶叶
博客地址:http://www.cnblogs.com/qiaoyeye/
本文版权归作者和博客园共有,欢迎转载,但未经作者同意必须保留此段声明,且在文章页面明显位置给出原文连接,否则保留追究法律责任的权利。
******************************************************************************************************************************************
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· go语言实现终端里的倒计时
· 如何编写易于单元测试的代码
· 10年+ .NET Coder 心语,封装的思维:从隐藏、稳定开始理解其本质意义
· .NET Core 中如何实现缓存的预热?
· 从 HTTP 原因短语缺失研究 HTTP/2 和 HTTP/3 的设计差异
· 周边上新:园子的第一款马克杯温暖上架
· Open-Sora 2.0 重磅开源!
· 分享 3 个 .NET 开源的文件压缩处理库,助力快速实现文件压缩解压功能!
· Ollama——大语言模型本地部署的极速利器
· DeepSeek如何颠覆传统软件测试?测试工程师会被淘汰吗?