111 lines
3.1 KiB
OpenEdge ABL
111 lines
3.1 KiB
OpenEdge ABL
|
#ifndef __MD4_H__
|
||
|
|
#define __MD4_H__
|
||
|
|
|
||
|
|
#ifndef RSA32API
|
||
|
|
#define RSA32API __stdcall
|
||
|
|
#endif
|
||
|
|
|
||
|
|
/*
|
||
|
|
** ********************************************************************
|
||
|
|
** md4.h -- Header file for implementation of **
|
||
|
|
** MD4 Message Digest Algorithm **
|
||
|
|
** Updated: 2/13/90 by Ronald L. Rivest **
|
||
|
|
** (C) 1990 RSA Data Security, Inc. **
|
||
|
|
** ********************************************************************
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
extern "C" {
|
||
|
|
#endif
|
||
|
|
|
||
|
|
// MD4Update Errors
|
||
|
|
#define MD4_SUCCESS 0
|
||
|
|
#define MD4_TOO_BIG 1
|
||
|
|
#define MD4_ALREADY_DONE 2
|
||
|
|
|
||
|
|
// MD4 Digest length -- 4 word result == 16 bytes
|
||
|
|
#define MD4DIGESTLEN 16
|
||
|
|
|
||
|
|
// Block size of MD4 -- Assumes 8 bits per byte
|
||
|
|
#define MD4BLOCKSIZE 64
|
||
|
|
#define MD4BYTESTOBITS(bytes) ((bytes)*8) // MDupdate wants bits
|
||
|
|
|
||
|
|
/* MDstruct is the data structure for a message digest computation.
|
||
|
|
*/
|
||
|
|
typedef struct {
|
||
|
|
unsigned long buffer[4]; /* Holds 4-word result of MD computation */
|
||
|
|
unsigned char count[8]; /* Number of bits processed so far */
|
||
|
|
unsigned int done; /* Nonzero means MD computation finished */
|
||
|
|
} MDstruct, *MDptr;
|
||
|
|
|
||
|
|
/* MDbegin(MD)
|
||
|
|
** Input: MD -- an MDptr
|
||
|
|
** Initialize the MDstruct prepatory to doing a message digest
|
||
|
|
** computation.
|
||
|
|
**
|
||
|
|
** MTS: Assumes MDPtr is locked against simultaneous use.
|
||
|
|
*/
|
||
|
|
extern void MDbegin(MDptr);
|
||
|
|
|
||
|
|
/* MDupdate(MD,X,count)
|
||
|
|
** Input: MD -- an MDptr
|
||
|
|
** X -- a pointer to an array of unsigned characters.
|
||
|
|
** count -- the number of bits of X to use (an unsigned int).
|
||
|
|
** Updates MD using the first "count" bits of X.
|
||
|
|
** The array pointed to by X is not modified.
|
||
|
|
** If count is not a multiple of 8, MDupdate uses high bits of
|
||
|
|
** last byte.
|
||
|
|
** This is the basic input routine for a user.
|
||
|
|
** The routine terminates the MD computation when count < MD4BLOCKSIZE, so
|
||
|
|
** every MD computation should end with one call to MDupdate with a
|
||
|
|
** count less than MD4BLOCKSIZE. Zero is OK for a count.
|
||
|
|
**
|
||
|
|
** Return values:
|
||
|
|
** MD4_SUCCESS: success
|
||
|
|
** MD4_TOO_LONG: Hash is already terminated
|
||
|
|
** MD4_ALREADY_DONE: Length is invalid (too big)
|
||
|
|
**
|
||
|
|
** MTS: Assumes MDPtr is locked against simultaneous use.
|
||
|
|
**
|
||
|
|
**
|
||
|
|
** NOTE: MDupdate wants the length in BITS
|
||
|
|
*/
|
||
|
|
extern int MDupdate(MDptr, const unsigned char *pbData, int wLen);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
|
||
|
|
This second implementation of MD4 entry points is the newer style,
|
||
|
|
optimized implementation, compatible with newer code expecting these
|
||
|
|
entry point names.
|
||
|
|
|
||
|
|
Scott Field (sfield) 21-Oct-97
|
||
|
|
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
#ifndef UINT4
|
||
|
|
#define UINT4 unsigned long
|
||
|
|
#endif
|
||
|
|
|
||
|
|
/* Data structure for MD4 (Message Digest) computation */
|
||
|
|
typedef struct {
|
||
|
|
UINT4 state[4]; /* state (ABCD) */
|
||
|
|
UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */
|
||
|
|
unsigned char buffer[64]; /* input buffer */
|
||
|
|
unsigned char digest[16]; /* actual digest after MD4Final call */
|
||
|
|
} MD4_CTX;
|
||
|
|
|
||
|
|
#define MD4_LEN 16
|
||
|
|
|
||
|
|
void RSA32API MD4Init (MD4_CTX *);
|
||
|
|
void RSA32API MD4Update (MD4_CTX *, unsigned char *, unsigned int);
|
||
|
|
void RSA32API MD4Final (MD4_CTX * );
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#endif __MD4_H__
|