RFC relevance of september

As per Relevance of the word september, we have this rfc below:

Network Working Group P.
Request for Comments: 2202
Category: Informational R.

September 1997

Test Cases for HMAC-MD5 and HMAC-SHA-1

Status of This

This memo provides information for the Internet community. This
does not specify an Internet standard of any kind. Distribution
this memo is unlimited

This document provides two sets of test cases for HMAC-MD5 and HMAC
SHA-1, respectively. HMAC-MD5 and HMAC-SHA-1 are two constructs
the HMAC [HMAC] message authentication function using the MD5 [MD5]
hash function and the SHA-1 [SHA] hash function. Both constructs
used by IPSEC [OG,CG] and other protocols to authenticate messages
The test cases and results provided in this document are meant to
used as a conformance test for HMAC-MD5 and HMAC-SHA-1
implementations

1.

The general method for constructing a HMAC message
function using a particular hash function is described in section 2
of [HMAC]. We will not repeat the description here. Section 5
[HMAC] also discusses truncating the output of HMAC; the rule is
we should keep the more significant bits (the bits in the left
assuming a network byte order (big-endian)).

In sections 2 and 3 we provide test cases for HMAC-MD5 and HMAC-SHA
1, respectively. Each case includes the key, the data, and
result. The values of keys and data are either hexadecimal
(prefixed by "0x") or ASCII character strings in double quotes. If
value is an ASCII character string, then the HMAC computation for
corresponding test case DOES NOT include the trailing null
('\0') in the string

Cheng & Glenn Informational [Page 1]

RFC 2202 Test Cases for HMAC-MD5 and HMAC-SHA-1 September 1997

The C source code of the functions used to generate HMAC-SHA-1
results is listed in the Appendix. Note that these functions
meant to be simple and easy to understand; they are not optimized
any way. The C source code for computing HMAC-MD5 can be found
[MD5]; or you can do a simple modification to HMAC-SHA-1 code to
HMAC-MD5 code, as explained in the Appendix

The test cases in this document are cross-verified by
independent implementations, one from NIST and two from IBM Research
One IBM implementation uses optimized code that is very
from the code in the Appendix. An implemenation that concurs with
results provided in this document should be interoperable with
similar implemenations. We do not claim that such an
is absolutely correct with respect to the HMAC definition in [HMAC].

2. Test Cases for HMAC-MD

test_case = 1
key = 0x0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0
key_len = 16
data = "Hi There
data_len = 8
digest = 0x9294727a3638bb1c13f48ef8158bfc9

test_case = 2
key = "Jefe
key_len = 4
data = "what do ya want for nothing?"
data_len = 28
digest = 0x750c783e6ab0b503eaa86e310a5db738

test_case = 3
key = 0
key_len 16
data = 0xdd repeated 50
data_len = 50
digest = 0x56be34521d144c88dbb8c733f0e8b3f

test_case = 4
key = 0x0102030405060708090a0b0c0d0e0f10111213141516171819
key_len 25
data = 0xcd repeated 50
data_len = 50
digest = 0x697eaf0aca3a3aea3a75164746ffaa79

Cheng & Glenn Informational [Page 2]

RFC 2202 Test Cases for HMAC-MD5 and HMAC-SHA-1 September 1997

test_case = 5
key = 0x0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0
key_len = 16
data = "Test With Truncation
data_len = 20
digest = 0x56461ef2342edc00f9bab995690efd4
digest-96 0x56461ef2342edc00f9bab995

test_case = 6
key = 0xaa repeated 80
key_len = 80
data = "Test Using Larger Than Block-Size Key - Hash Key First
data_len = 54
digest = 0x6b1ab7fe4bd7bf8f0b62e6ce61b9d0

test_case = 7
key = 0xaa repeated 80
key_len = 80
data = "Test Using Larger Than Block-Size Key and
Than One Block-Size Data
data_len = 73
digest = 0x6f630fad67cda0ee1fb1f562db3aa53

3. Test Cases for HMAC-SHA-1

test_case = 1
key = 0x0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0
key_len = 20
data = "Hi There
data_len = 8
digest = 0xb617318655057264e28bc0b6fb378c8ef146be00

test_case = 2
key = "Jefe
key_len = 4
data = "what do ya want for nothing?"
data_len = 28
digest = 0xeffcdf6ae5eb2fa2d27416d5f184df9c259a7c79

test_case = 3
key = 0
key_len = 20
data = 0xdd repeated 50
data_len = 50
digest = 0x125d7342b9ac11cd91a39af48aa17b4f63f175d

Cheng & Glenn Informational [Page 3]

RFC 2202 Test Cases for HMAC-MD5 and HMAC-SHA-1 September 1997

test_case = 4
key = 0x0102030405060708090a0b0c0d0e0f10111213141516171819
key_len = 25
data = 0xcd repeated 50
data_len = 50
digest = 0x4c9007f4026250c6bc8414f9bf50c86c2d7235

test_case = 5
key = 0x0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0c0
key_len = 20
data = "Test With Truncation
data_len = 20
digest = 0x4c1a03424b55e07fe7f27be1d58bb9324a9a5a04
digest-96 = 0x4c1a03424b55e07fe7f27be

test_case = 6
key = 0xaa repeated 80
key_len = 80
data = "Test Using Larger Than Block-Size Key - Hash Key First
data_len = 54
digest = 0xaa4ae5e15272d00e95705637ce8a3b55ed402112

test_case = 7
key = 0xaa repeated 80
key_len = 80
data = "Test Using Larger Than Block-Size Key and
Than One Block-Size Data
data_len = 73
digest = 0xe8e99d0f45237d786d6bbaa7965c7808bbff1a91
data_len = 20
digest = 0x4c1a03424b55e07fe7f27be1d58bb9324a9a5a04
digest-96 = 0x4c1a03424b55e07fe7f27be

test_case = 6
key = 0xaa repeated 80
key_len = 80
data = "Test Using Larger Than Block-Size Key - Hash
First
data_len = 54
digest = 0xaa4ae5e15272d00e95705637ce8a3b55ed402112

test_case = 7
key = 0xaa repeated 80
key_len = 80
data = "Test Using Larger Than Block-Size Key and
Than One Block-Size Data
data_len = 73
digest = 0xe8e99d0f45237d786d6bbaa7965c7808bbff1a91

Cheng & Glenn Informational [Page 4]

RFC 2202 Test Cases for HMAC-MD5 and HMAC-SHA-1 September 1997

4. Security

This docuemnt raises no security issues. Discussion on the
of the HMAC construction can be found in [HMAC].

[HMAC] Krawczyk, H., Bellare, M., and R. Canetti
"HMAC: Keyed-Hashing for Message Authentication",
RFC 2104, February 1997.

[MD5] Rivest, R., "The MD5 Message-Digest Algorithm",
RFC 1321, April 1992.

[SHA] NIST, FIPS PUB 180-1: Secure Hash Standard, April 1995.

[OG] Oehler, M., and R. Glenn
"HMAC-MD5 IP Authentication with Replay Prevention",
RFC 2085, February 1997.

[CG] Chang, S., and R. Glenn
"HMAC-SHA IP Authentication with Replay Prevention",
Work in Progress

Cheng & Glenn Informational [Page 5]

RFC 2202 Test Cases for HMAC-MD5 and HMAC-SHA-1 September 1997

Authors'

Pau-Chen
IBM T.J. Watson Research
P.O.Box 704
Yorktown Heights, NY 10598

EMail: pau@watson.ibm.

Robert

Building 820, Room 455
Gaithersburg, MD 20899

EMail: rob.glenn@nist.

Cheng & Glenn Informational [Page 6]

RFC 2202 Test Cases for HMAC-MD5 and HMAC-SHA-1 September 1997

This appendix contains the C reference code which implements HMAC
SHA-1 using an existing SHA-1 library. It assumes that the SHA-1
library has similar API's as those of the MD5 code described in
1321. The code for HMAC-MD5 is similar, just replace the
"SHA" and "sha" with "MD5" and "md5". HMAC-MD5 code is also listed
RFC 2104.

#ifndef SHA_
#define SHA_DIGESTSIZE 20
#

#ifndef SHA_
#define SHA_BLOCKSIZE 64
#

#ifndef MD5_
#define MD5_DIGESTSIZE 16
#

#ifndef MD5_
#define MD5_BLOCKSIZE 64
#

/* Function to print the digest */

pr_sha(FILE* fp, char* s, int t
{
int i ;

fprintf(fp, "0x") ;
for (i = 0 ; i < t ; i++)
fprintf(fp, "%02x", s[i]) ;
fprintf(fp, "0) ;
}

void
(
char* d1, /* data to be truncated */
char* d2, /* truncated data */
int len /* length in bytes to keep */
)
{
int i ;
for (i = 0 ; i < len ; i++) d2[i] = d1[i];
}

Cheng & Glenn Informational [Page 7]

RFC 2202 Test Cases for HMAC-MD5 and HMAC-SHA-1 September 1997

/* Function to compute the digest */

hmac_
(
char* k, /* secret key */
int lk, /* length of the key in bytes */
char* d, /* data */
int ld, /* length of data in bytes */
char* out, /* output buffer, at least "t" bytes */
int
)
{
SHA_CTX ictx, octx ;
char isha[SHA_DIGESTSIZE], osha[SHA_DIGESTSIZE] ;
char key[SHA_DIGESTSIZE] ;
char buf[SHA_BLOCKSIZE] ;
int i ;

if (lk > SHA_BLOCKSIZE) {

SHA_CTX tctx ;

SHAInit(&tctx) ;
SHAUpdate(&tctx, k, lk) ;
SHAFinal(key, &tctx) ;

k = key ;
lk = SHA_DIGESTSIZE ;
}

/**** Inner Digest ****/

SHAInit(&ictx) ;

/* Pad the key for inner digest */
for (i = 0 ; i < lk ; ++i) buf[i] = k[i] ^ 0x36 ;
for (i = lk ; i < SHA_BLOCKSIZE ; ++i) buf[i] = 0x36 ;

SHAUpdate(&ictx, buf, SHA_BLOCKSIZE) ;
SHAUpdate(&ictx, d, ld) ;

SHAFinal(isha, &ictx) ;

/**** Outter Digest ****/

SHAInit(&octx) ;

/* Pad the key for outter digest */

Cheng & Glenn Informational [Page 8]

RFC 2202 Test Cases for HMAC-MD5 and HMAC-SHA-1 September 1997

for (i = 0 ; i < lk ; ++i) buf[i] = k[i] ^ 0x5C ;
for (i = lk ; i < SHA_BLOCKSIZE ; ++i) buf[i] = 0x5C ;

SHAUpdate(&octx, buf, SHA_BLOCKSIZE) ;
SHAUpdate(&octx, isha, SHA_DIGESTSIZE) ;

SHAFinal(osha, &octx) ;

/* truncate and print the results */
t = t > SHA_DIGESTSIZE ? SHA_DIGESTSIZE : t ;
truncate(osha, out, t) ;
pr_sha(stdout, out, t) ;

}

Cheng & Glenn Informational [Page 9]

if you see any problems within the linking, don't worry be happy,
this is version 0.1 of the Relevance System and you gotta expect some crappy subroutines sometimes,
just be content we did not write this in Java, which would have made this "bigger and better" HAHAHHA.

RFC documents can be found at I.E.T.F.

Relevance System Copyright © 2002 Spectrum WorldResearch
other technical nosh by ServerMasters Corporation
collaboration of BobX