• 认证加密算法php hash_hmac和java hmacSha1的问题


    public class Test{
    	
    
    	public static void main(String[] args) throws Exception {
                    String postString = "abc";
                    String signature = ByteToHex(genHMAC(postString, "310A54B3C9C12920E1582E016F15DD441ACE8553769E8991")).toUpperCase();        
    	}
    	
    	/** 
         * 使用 HMAC-SHA1 签名方法对data进行签名 
         *  
         * @param data 
         *            被签名的字符串 
         * @param key 
         *            密钥      
         * @return  
                          加密后的字符串 
         */  
        public static byte[] genHMAC(String data, String key) {  
            byte[] result = null;  
            try {  
                //根据给定的字节数组构造一个密钥,第二参数指定一个密钥算法的名称    
                SecretKeySpec signinKey = new SecretKeySpec(hexString2Bytes(key), "HmacSHA1");  
                //生成一个指定 Mac 算法 的 Mac 对象    
                Mac mac = Mac.getInstance("HmacSHA1");  
                //用给定密钥初始化 Mac 对象    
                mac.init(signinKey);  
                //完成 Mac 操作     
                byte[] rawHmac = mac.doFinal(data.getBytes());  
                result = rawHmac;  
      
            } catch (NoSuchAlgorithmException e) {  
                System.err.println(e.getMessage());  
            } catch (InvalidKeyException e) {  
                System.err.println(e.getMessage());  
            }  
            if (null != result) {  
                return result;  
            } else {  
                return null;  
            }  
        }
    	
    	public static byte[] hexString2Bytes(String src) {  
            int l = src.length() / 2;  
            byte[] ret = new byte[l];  
            for (int i = 0; i < l; i++) {  
                ret[i] = (byte) Integer  
                        .valueOf(src.substring(i * 2, i * 2 + 2), 16).byteValue();  
            }  
            return ret;  
        } 
    
    	// btye转换hex函数
        public static String ByteToHex(byte[] byteArray) {
            StringBuffer StrBuff = new StringBuffer();
            for (int i = 0; i < byteArray.length; i++) {
                if (Integer.toHexString(0xFF & byteArray[i]).length() == 1) {
                    StrBuff.append("0").append(
                            Integer.toHexString(0xFF & byteArray[i]));
                } else {
                    StrBuff.append(Integer.toHexString(0xFF & byteArray[i]));
                }
            }
            return StrBuff.toString();
        }
    
    }    
    

    方法一:

    $str = "abc";
    $key = "310A54B3C9C12920E1582E016F15DD441ACE8553769E8991";
    $decodedKey = pack("H*", $key);  //十六进制转成字符串
    $hash = bin2hex(hash_hmac("sha1", $str, $decodedKey, true));
    

      

    方法二:

    //字节数组转化为String类型的数据
    function toStr($bytes) {
        $str = '';
        foreach($bytes as $ch) {
            $str .= chr($ch);
        }
        return $str;
    }
    //字符串转十六进制
    function String2Hex($string){
        $hex='';
        for ($i=0; $i < strlen($string); $i++){
            $hex .= dechex(ord($string[$i]));
        }
        return $hex;
    }
    
    //十六进制转字符串
    function Hex2String($hex){
        $string='';
        for ($i=0; $i < strlen($hex)-1; $i+=2){
            $string .= chr(hexdec($hex[$i].$hex[$i+1]));
        }
        return $string;
    }
    
    $str = "abc";
    $key = "310A54B3C9C12920E1582E016F15DD441ACE8553769E8991";
    $decodedKey = pack("H*", $key);  //十六进制转字符串
    $hash = hash_hmac("sha1", $str, $decodedKey, true);
    //字符串转字节数组,即ascii数组 $hashs = str_split($hash); foreach ($hashs as $index => $value) { if (ord($value) > 128) { $hashs[$index] = ord($value) - 128 * 2; } else { $hashs[$index] = ord($value); } } $signature = String2Hex(toStr($hashs)); echo $signature;

      

  • 相关阅读:
    How Many Tables 并查集(求有几个集合)
    Spell checker 字典树&&普通查找(加计数)
    昂贵的聘礼 dijstra算法(要枚举源点)
    All in All 找子串 水题
    Ultra-QuickSort 求逆序对 归并排序
    Snowflake Snow Snowflakes 根据相似度排序,有点暴力
    Gold Balanced Lineup hash函数,第一次接触,借鉴了大神的博客思想,看了很久才看懂,弱菜啦
    Stockbroker Grapevine 裸的floyd算法,求最大中的最小
    Check the difficulty of problems 概率dp,概率知识很重要
    [leetcode] Valid Anagram 、 Find All Anagrams in a String
  • 原文地址:https://www.cnblogs.com/luojianqun/p/9375830.html
Copyright © 2020-2023  润新知