百度知道 - 信息提示
知道宝贝找不到问题了&_&!!
该问题可能已经失效。
秒以后自动返回8106人阅读
C & C++（39）
/****************************************************************/
/* 802.11i HMAC-SHA-1 Test Code
/* Copyright (c) 2002, David Johnston
/* Author: David Johnston
/* Email (home):
/* Email (general): david.johnston@ieee.org
/* Version 0.1
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program.
If not, see &http://www.gnu.org/licenses/&.
/* This code implements the NIST HMAC-SHA-1 algorithm as used
/* the IEEE 802.11i security spec.
/* Supported message length is limited to 4096 characters
Sort out endian tolerance. Currently little endian.
/****************************************************************/
#include &stdlib.h&
#include &stdio.h&
#define MAX_MESSAGE_LENGTH 4096
/********************************************/
/* Test Cases
/* An array of test cases taken from the
/* 802.11i specification.
/********************************************/
#define NUM_TEST_CASES
int test_case_length[] = {9,8,28,50,50,20,54,73,54,73};
unsigned char test_cases[] =
/* &Sample #1& */
0x53,0x61,0x6d,0x70,0x6c,0x65,0x20,0x23,0x31,
/* &Hi There&
0x48,0x69,0x20,0x54,0x68,0x65,0x72,0x65,
/* &what do ya want for nothing?& */
0x77,0x68,0x61,0x74,0x20,0x64,0x6f,0x20,0x79,0x61,
0x20,0x77,0x61,0x6e,0x74,0x20,0x66,0x6f,0x72,0x20,
0x6e,0x6f,0x74,0x68,0x69,0x6e,0x67,0x3f,
0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,
0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,
0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,
0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,
0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,0xdd,
0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,
0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,
0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,
0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,
0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,0xcd,
/* &Test With Truncation& */
0x54,0x65,0x73,0x74,0x20,0x57,0x69,0x74,0x68,0x20,0x54,0x72,0x75,0x6e,0x63,0x61,
0x74,0x69,0x6f,0x6e,
/* &Test Using Larger Than Block-Size Key - Hash Key First& */
0x54,0x65,0x73,0x74,0x20,0x55,0x73,0x69,0x6e,0x67,0x20,0x4c,0x61,0x72,0x67,0x65,
0x72,0x20,0x54,0x68,0x61,0x6e,0x20,0x42,0x6c,0x6f,0x63,0x6b,0x2d,0x53,0x69,0x7a,
0x65,0x20,0x4b,0x65,0x79,0x20,0x2d,0x20,0x48,0x61,0x73,0x68,0x20,0x4b,0x65,0x79,
0x20,0x46,0x69,0x72,0x73,0x74,
/* &Test Using Larger Than Block-Size Key and Larger Than One Block-Size Data& */
0x54,0x65,0x73,0x74,0x20,0x55,0x73,0x69,0x6e,0x67,0x20,0x4c,0x61,0x72,0x67,0x65,
0x72,0x20,0x54,0x68,0x61,0x6e,0x20,0x42,0x6c,0x6f,0x63,0x6b,0x2d,0x53,0x69,0x7a,
0x65,0x20,0x4b,0x65,0x79,0x20,0x61,0x6e,0x64,0x20,0x4c,0x61,0x72,0x67,0x65,0x72,
0x20,0x54,0x68,0x61,0x6e,0x20,0x4f,0x6e,0x65,0x20,0x42,0x6c,0x6f,0x63,0x6b,0x2d,
0x53,0x69,0x7a,0x65,0x20,0x44,0x61,0x74,0x61,
/* &Test Using Larger Than Block-Size Key - Hash Key First& */
0x54,0x65,0x73,0x74,0x20,0x55,0x73,0x69,0x6e,0x67,0x20,0x4c,0x61,0x72,0x67,0x65,
0x72,0x20,0x54,0x68,0x61,0x6e,0x20,0x42,0x6c,0x6f,0x63,0x6b,0x2d,0x53,0x69,0x7a,
0x65,0x20,0x4b,0x65,0x79,0x20,0x2d,0x20,0x48,0x61,0x73,0x68,0x20,0x4b,0x65,0x79,
0x20,0x46,0x69,0x72,0x73,0x74,
/* &Test Using Larger Than Block-Size Key and Larger Than One Block-Size Data& */
0x54,0x65,0x73,0x74,0x20,0x55,0x73,0x69,0x6e,0x67,0x20,0x4c,0x61,0x72,0x67,0x65,
0x72,0x20,0x54,0x68,0x61,0x6e,0x20,0x42,0x6c,0x6f,0x63,0x6b,0x2d,0x53,0x69,0x7a,
0x65,0x20,0x4b,0x65,0x79,0x20,0x61,0x6e,0x64,0x20,0x4c,0x61,0x72,0x67,0x65,0x72,
0x20,0x54,0x68,0x61,0x6e,0x20,0x4f,0x6e,0x65,0x20,0x42,0x6c,0x6f,0x63,0x6b,0x2d,
0x53,0x69,0x7a,0x65,0x20,0x44,0x61,0x74,0x61
int key_lengths[] =
64, 20,4,20,25,20,80,80,80,80
unsigned char keys[] =
0x00,0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09,0x0a,0x0b,0x0c,0x0d,0x0e,0x0f,
0x10,0x11,0x12,0x13,0x14,0x15,0x16,0x17,0x18,0x19,0x1a,0x1b,0x1c,0x1d,0x1e,0x1f,
0x20,0x21,0x22,0x23,0x24,0x25,0x26,0x27,0x28,0x29,0x2a,0x2b,0x2c,0x2d,0x2e,0x2f,
0x30,0x31,0x32,0x33,0x34,0x35,0x36,0x37,0x38,0x39,0x3a,0x3b,0x3c,0x3d,0x3e,0x3f,
0x0b,0x0b,0x0b,0x0b,0x0b,0x0b,0x0b,0x0b,
0x0b,0x0b,0x0b,0x0b,0x0b,0x0b,0x0b,0x0b,
0x0b,0x0b,0x0b,0x0b,
0x4a,0x65,0x66,0x65, /* &Jefe& */
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0x01,0x02,0x03,0x04,0x05,0x06,0x07,0x08,0x09,0x0a,
0x0b,0x0c,0x0d,0x0e,0x0f,0x10,0x11,0x12,0x13,0x14,
0x15,0x16,0x17,0x18,0x19,
0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,
0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,0x0c,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,
0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa,0xaa
/*****************************/
/**** Function Prototypes ****/
/*****************************/
unsigned long int ft(
unsigned long int x,
unsigned long int y,
unsigned long int z
int get_testcase(
int test_case,
unsigned char *plaintext,
unsigned char *key,
int *key_length_ptr);
unsigned char *message,
int message_length,
unsigned char *digest
/**************************/
/* Debug out
/**************************/
#ifdef HMAC_DEBUG
debug_out(
unsigned char *label,
unsigned char *data,
int data_length
int block_
num_blocks = data_length / 16;
block_remainder = data_length % 16;
printf(&%s\n&,label);
for (i=0; i& num_i++)
printf(&\t&);
for (j=0; j& 16;j++)
printf(&%02x &, data[j + (i*16)]);
printf(&\n&);
if (block_remainder & 0)
printf(&\t&);
for (j=0; j&block_ j++)
printf(&%02x &, data[j+(num_blocks*16)]);
printf(&\n&);
/****************************************/
/* Performs the NIST SHA-1 algorithm
/****************************************/
unsigned long int ft(
unsigned long int x,
unsigned long int y,
unsigned long int z
unsigned long int a,b,c;
if (t & 20)
b = (~x) &
else if (t & 40)
c = x ^ y ^
else if (t & 60)
b = a ^ (x & z);
c = b ^ (y & z);
else if (t & 80)
c = (x ^ y) ^
unsigned long int k(int t)
if (t & 20)
c = 0x5a827999;
else if (t & 40)
c = 0x6ed9eba1;
else if (t & 60)
else if (t & 80)
c = 0xca62c1d6;
unsigned long int rotr(int bits, unsigned long int a)
unsigned long int c,d,e,f,g;
c = (0x0001 && bits)-1;
e = (a & d) &&
f = (a & c) && (32 - bits);
return (g & 0xffffffff );
unsigned long int rotl(int bits, unsigned long int a)
unsigned long int c,d,e,f,g;
c = (0x0001 && (32-bits))-1;
e = (a & c) &&
f = (a & d) && (32 - bits);
return (g & 0xffffffff );
unsigned char *message,
int message_length,
unsigned char *digest
int block_
int padded_
unsigned long int h[5];
unsigned long int a,b,c,d,e;
unsigned long int w[80];
#ifdef SHA1_DEBUG
/* Calculate the number of 512 bit blocks */
padded_length = message_length + 8; /* Add length for l */
padded_length = padded_length + 1; /* Add the 0x01 bit postfix */
l = message_length * 8;
num_blocks = padded_length / 64;
block_remainder = padded_length % 64;
if (block_remainder & 0)
num_blocks++;
padded_length = padded_length + (64 - block_remainder);
/* clear the padding field */
for (i = message_ i & (num_blocks * 64); i++)
message[i] = 0x00;
/* insert b1 padding bit */
message[message_length] = 0x80;
/* Insert l */
message[(num_blocks*64)-1] = (unsigned char)( l
message[(num_blocks*64)-2] = (unsigned char)((l && 8)
message[(num_blocks*64)-3] = (unsigned char)((l && 16) & 0xff);
message[(num_blocks*64)-4] = (unsigned char)((l && 24) & 0xff);
/* Set initial hash state */
h[0] = 0x;
h[1] = 0xefcdab89;
h[2] = 0x98
h[3] = 0x;
h[4] = 0xc3d2e1f0;
#ifdef SHA1_DEBUG
printf(&INITIAL message_length = %d\n&, message_length);
printf(&INITIAL padded_length = %d\n&, padded_length);
printf(&INITIAL num_blocks = %d\n&, num_blocks);
for (x=0;x&num_ x++)
printf(&\t\t&);
for (y=0; y&16;y++)
printf(&%02x &,message[y + (x*64)]);
printf(&\n&);
printf(&\t\t&);
for (y=0; y&16;y++)
printf(&%02x &,message[16 + y + (x*64)]);
printf(&\n&);
printf(&\t\t&);
for (y=0; y&16;y++)
printf(&%02x &,message[32 + y + (x*64)]);
printf(&\n&);
printf(&\t\t&);
for (y=0; y&16;y++)
printf(&%02x &,message[48 + y + (x*64)]);
printf(&\n&);
for (i = 0; i & num_ i++)
/* Prepare the message schedule */
for (t=0; t & 80; t++)
if (t & 16)
= (256*256*256) * message[(i*64)+(t*4)];
w[t] += (256*256
) * message[(i*64)+(t*4) + 1];
w[t] += (256
) * message[(i*64)+(t*4) + 2];
message[(i*64)+(t*4) + 3];
else if (t & 80)
w[t] = rotl(1,(w[t-3] ^ w[t-8] ^ w[t-14] ^ w[t-16]));
#ifdef SHA1_DEBUG
printf(&\tW(0) = %08lX \t W(9)
= %08lX \n&, w[0], w[8]);
printf(&\tW(1) = %08lX \t W(10) = %08lX \n&, w[1], w[9]);
printf(&\tW(2) = %08lX \t W(11) = %08lX \n&, w[2], w[10]);
printf(&\tW(3) = %08lX \t W(12) = %08lX \n&, w[3], w[11]);
printf(&\tW(4) = %08lX \t W(13) = %08lX \n&, w[4], w[12]);
printf(&\tW(5) = %08lX \t W(14) = %08lX \n&, w[5], w[13]);
printf(&\tW(6) = %08lX \t W(15) = %08lX \n&, w[6], w[14]);
printf(&\tW(7) = %08lX \t W(16) = %08lX \n\n&, w[7], w[15]);
/* Initialize the five working variables */
/* iterate a-e 80 times */
for (t = 0; t & 80; t++)
temp = (rotl(5,a) + ft(t,b,c,d)) & 0
temp = (temp + e) & 0
temp = (temp + k(t)) & 0
temp = (temp + w[t]) & 0
c = rotl(30,b);
#ifdef SHA1_DEBUG
printf(&t = %2ld\t %08lx, %08lx, %08lx, %08lx, %08lx\n&, t,a,b,c,d,e);
/* compute the ith intermediate hash value */
#ifdef SHA1_DEBUG
\t %08lx, %08lx, %08lx, %08lx, %08lx\n&, h[0],h[1],h[2],h[3],h[4]);
h[0] = (a + h[0]) & 0
h[1] = (b + h[1]) & 0
h[2] = (c + h[2]) & 0
h[3] = (d + h[3]) & 0
h[4] = (e + h[4]) & 0
#ifdef SHA1_DEBUG
\t %08lx, %08lx, %08lx, %08lx, %08lx\n&, h[0],h[1],h[2],h[3],h[4]);
= (unsigned char) ( h[0]
= (unsigned char) ((h[0] && 8) & 0xff);
= (unsigned char) ((h[0] && 16) & 0xff);
= (unsigned char) ((h[0] && 24) & 0xff);
= (unsigned char) ( h[1]
= (unsigned char) ((h[1] && 8) & 0xff);
= (unsigned char) ((h[1] && 16) & 0xff);
= (unsigned char) ((h[1] && 24) & 0xff);
digest[11]
= (unsigned char) ( h[2]
digest[10]
= (unsigned char) ((h[2] && 8) & 0xff);
digest[9] = (unsigned char) ((h[2] && 16) & 0xff);
digest[8] = (unsigned char) ((h[2] && 24) & 0xff);
digest[15] = (unsigned char) ( h[3]
digest[14] = (unsigned char) ((h[3] && 8) & 0xff);
digest[13] = (unsigned char) ((h[3] && 16) & 0xff);
digest[12] = (unsigned char) ((h[3] && 24) & 0xff);
digest[19] = (unsigned char) ( h[4]
digest[18] = (unsigned char) ((h[4] && 8) & 0xff);
digest[17] = (unsigned char) ((h[4] && 16) & 0xff);
digest[16] = (unsigned char) ((h[4] && 24) & 0xff);
/******************************************************/
/* hmac-sha1()
/* Performs the hmac-sha1 keyed secure hash algorithm */
/******************************************************/
void hmac_sha1(
unsigned char *key,
int key_length,
unsigned char *data,
int data_length,
unsigned char *digest
int b = 64; /* blocksize */
unsigned char ipad = 0x36;
unsigned char opad = 0x5c;
unsigned char k0[64];
unsigned char k0xorIpad[64];
unsigned char step7data[64];
unsigned char step5data[MAX_MESSAGE_LENGTH+128];
unsigned char step8data[64+20];
for (i=0; i&64; i++)
k0[i] = 0x00;
if (key_length != b)
/* Step 1 */
/* Step 2 */
if (key_length & b)
sha1(key, key_length, digest);
for (i=0;i&20;i++)
k0[i]=digest[i];
else if (key_length & b)
/* Step 3 */
for (i=0; i&key_ i++)
k0[i] = key[i];
for (i=0;i&b;i++)
k0[i] = key[i];
#ifdef HMAC_DEBUG
debug_out(&k0&,k0,64);
/* Step 4 */
for (i=0; i&64; i++)
k0xorIpad[i] = k0[i] ^
#ifdef HMAC_DEBUG
debug_out(&k0 xor ipad&,k0xorIpad,64);
/* Step 5 */
for (i=0; i&64; i++)
step5data[i] = k0xorIpad[i];
for (i=0;i&data_i++)
step5data[i+64] = data[i];
#ifdef HMAC_DEBUG
debug_out(&(k0 xor ipad) || text&,step5data,data_length+64);
/* Step 6 */
sha1(step5data, data_length+b, digest);
#ifdef HMAC_DEBUG
debug_out(&Hash((k0 xor ipad) || text)&,digest,20);
/* Step 7 */
for (i=0; i&64; i++)
step7data[i] = k0[i] ^
#ifdef HMAC_DEBUG
debug_out(&(k0 xor opad)&,step7data,64);
/* Step 8 */
for (i=0;i&64;i++)
step8data[i] = step7data[i];
for (i=0;i&20;i++)
step8data[i+64] = digest[i];
#ifdef HMAC_DEBUG
debug_out(&(k0 xor opad) || Hash((k0 xor ipad) || text)&,step8data,20+64);
/* Step 9 */
sha1(step8data, b+20, digest);
#ifdef HMAC_DEBUG
debug_out(&HASH((k0 xor opad) || Hash((k0 xor ipad) || text))&,digest,20);
/************************************************/
/* get_testcase()
/* Copies a test case from the test case data
/************************************************/
int get_testcase(
int test_case,
unsigned char *plaintext,
unsigned char *key,
int *key_length_ptr)
unsigned char *
unsigned char *key_
/* Find and copy the key */
for (i=0;i & (test_case-1);i++)
key_ptr = key_ptr + key_lengths[i];
for (i=0; i& key_lengths[test_case-1]; i++)
key[i] = *key_ptr++;
/* Pass back the key length */
*key_length_ptr = key_lengths[test_case-1];
ptr = test_
for (i=0; i& (test_case-1); i++)
/* Iterate through test cases */
ptr = ptr + test_case_length[i];
for (i=0; i& test_case_length[test_case-1]; i++)
plaintext[i] = *ptr++;
return test_case_length[test_case-1];
/****************************************************/
/* Iterate through the test cases, passing them
/* through the hmac-sha-1 algorithm to produce test */
/* vectors
/****************************************************/
int main()
int block_
int num_key_
int key_block_
unsigned char plaintext[MAX_MESSAGE_LENGTH+128];
unsigned char digest[20];
unsigned char key[256];
int *key_length_
key_length_ptr = &key_
for (test_case = 1; test_case & (NUM_TEST_CASES+1); test_case++)
printf(&Getting test case %d\n&,test_case);
length = get_testcase(test_case, plaintext, key, key_length_ptr);
num_blocks = length / 16;
/* Calculate number of 16 byte blocks */
block_remainder = length % 16;
num_key_blocks = key_length / 16;
/* Calculate number of 16 byte blocks */
key_block_remainder = key_length % 16;
printf (&TEST CASE %d\n&,test_case);
printf (&\tKey Length = %d\n&, key_length);
printf (&\tKEY =\n&);
for (i=0;i&num_key_ i++)
printf(&\t\t&);
for (j=0; j&16;j++)
printf(&%02x &,key[j + (i*16)]);
printf(&\n&);
if (key_block_remainder & 0)
/* Print the final line */
printf(&\t\t&);
for (j=0; j&key_block_j++)
printf(&%02x &,key[j + ((num_key_blocks)*16)]);
printf(&\n&);
printf (&\tData Length = %d\n&,length);
printf (&\tDATA =\n&);
for (i=0;i&num_ i++)
printf(&\t\t&);
for (j=0; j&16;j++)
printf(&%02x &,plaintext[j + (i*16)]);
printf(&\n&);
if (block_remainder & 0)
/* Print the final line */
printf(&\t\t&);
for (j=0; j&block_j++)
printf(&%02x &,plaintext[j + (num_blocks*16)]);
printf(&\n&);
hmac_sha1(key, key_length, plaintext, length, digest);
printf (&\tDigest (lsb first, msb last) =\n&);
printf(&\t\t%02x %02x %02x %02x %02x %02x %02x %02x %02x %02x\n&,
digest[0], digest[1], digest[2], digest[3], digest[4],
digest[5], digest[6], digest[7], digest[8], digest[9]);
printf(&\t\t%02x %02x %02x %02x %02x %02x %02x %02x %02x %02x\n\n&,
digest[10], digest[11], digest[12], digest[13], digest[14],
digest[15], digest[16], digest[17], digest[18], digest[19]);
参考知识库
* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
访问：398399次
积分：5327
积分：5327
排名：第3534名
原创：113篇
转载：195篇
评论：47条
(3)(1)(1)(5)(12)(3)(5)(1)(6)(11)(45)(72)(7)(6)(3)(3)(1)(1)(2)(12)(10)(8)(3)(2)(2)(1)(14)(1)(1)(2)(3)(3)(2)(1)(2)(1)(1)(2)(1)(8)(8)(2)(15)(1)(2)(1)(1)(9)(7)(1)nodejs里面怎么实现HMAC-SHA1啊？ - CNode技术社区
这家伙很懒，什么个性签名都没有留下。
假设应用密钥为“appSecret”，签名参数列表“foo=1,bar=2,baz=3”，拼接排序后为“bar=2&baz=3&foo=1”，那么，sign的值为BASE64(HMAC-SHA1(“bar=2&baz=3&foo=1”,“appSecret”))。—nodejs里面怎么实现HMAC-SHA1啊？var sign=crypto.createHmac(‘sha1’, app_secret).update(args).digest(“base64”);用这样也不行呢，不知道你是怎么解决的？求回复（在做电信开放平台的短信验证码下发。）
var args=&app_id=123&access_token=abc&;
var app_secret=&123456&;
var sign=crypto.createHmac('sha1', app_secret).update(args).digest().toString('base64');
console.log(sign);
nodejs加密后的结果是：n8NDFgg7tMpfojJwUp2Hs+Td9yQ=
可是电信提供的是：
中国电信天翼开放平台客服 11:07:10
1.sign_before =“app_id=123&access_token=abc”
这是即将要编码的字符串
2.b=HmacSHA1(sign_before, app_secret);
第一步：先把字符串用HmacSHA1方式进行编码.
假如app_secret的值设为:”123456”,经过编码后得出的值为：”[B”
3.sign_after=BASE64(b)
第二步：把第一步里得到的值进行BAsE64编码：sign_after=BASE64(”[B”)
最后获取得到的值为：”C4Fdpr8vZiRKGR1OlI7CcUmxHMg=”
解决了，crypto.createHmac(‘sha1’, app_secret).update(args).digest().toString(‘base64’); 这样的加密就是hmac-sha1的。之前是因为要加密的参数忘记排序的了。
CNode 社区为国内最专业的 Node.js 开源技术社区，致力于 Node.js 的技术研究。
服务器赞助商为
，存储赞助商为
，由提供应用性能服务。
新手搭建 Node.js 服务器，推荐使用无需备案的oauth2.0 中token的生产算法是怎么样的
OAuth 下的最新文章
Ɣ回顶部