sha1.c revision a0b85df49408b3ff0ca3c0780974f13a7b485ae3
/*
* Copyright 2005 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/*
* The basic framework for this code came from the reference
* implementation for MD5. That implementation is Copyright (C)
* 1991-2, RSA Data Security, Inc. Created 1991. All rights reserved.
*
* License to copy and use this software is granted provided that it
* is identified as the "RSA Data Security, Inc. MD5 Message-Digest
* Algorithm" in all material mentioning or referencing this software
* or this function.
*
* License is also granted to make and use derivative works provided
* that such works are identified as "derived from the RSA Data
* Security, Inc. MD5 Message-Digest Algorithm" in all material
* mentioning or referencing the derived work.
*
* RSA Data Security, Inc. makes no representations concerning either
* the merchantability of this software or the suitability of this
* software for any particular purpose. It is provided "as is"
* without express or implied warranty of any kind.
*
* These notices must be retained in any copies of any part of this
*
* NOTE: Cleaned-up and optimized, version of SHA1, based on the FIPS 180-1
* standard, available at http://www.itl.nist.gov/div897/pubs/fip180-1.htm
* Not as fast as one would like -- further optimizations are encouraged
* and appreciated.
*/
#include <sys/sysmacros.h>
#include <sys/sha1_consts.h>
#ifdef _KERNEL
/*
* The sha1 module is created with two modlinkages:
* - a modlmisc that allows consumers to directly call the entry points
* SHA1Init, SHA1Update, and SHA1Final.
* - a modlcrypto that allows the module to register with the Kernel
* Cryptographic Framework (KCF) as a software provider for the SHA1
* mechanisms.
*/
#endif /* _KERNEL */
#ifndef _KERNEL
#include <strings.h>
#include <stdlib.h>
#include <errno.h>
#include <sys/systeminfo.h>
#endif /* !_KERNEL */
/*
* F, G, and H are the basic SHA1 functions.
*/
#define F(b, c, d) (((b) & (c)) | ((~b) & (d)))
#define G(b, c, d) ((b) ^ (c) ^ (d))
#define H(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
/*
* ROTATE_LEFT rotates x left n bits.
*/
#define ROTATE_LEFT(x, n) \
(((x) << (n)) | ((x) >> ((sizeof (x) * NBBY)-(n))))
#ifdef _KERNEL
"SHA1 Message-Digest Algorithm"
};
static struct modlcrypto modlcrypto = {
"SHA1 Kernel SW Provider %I%"
};
static struct modlinkage modlinkage = {
};
/*
* CSPI information (entry points, provider info, etc.)
*/
typedef enum sha1_mech_type {
SHA1_MECH_INFO_TYPE, /* SUN_CKM_SHA1 */
SHA1_HMAC_MECH_INFO_TYPE, /* SUN_CKM_SHA1_HMAC */
SHA1_HMAC_GEN_MECH_INFO_TYPE /* SUN_CKM_SHA1_HMAC_GENERAL */
/*
* Context for SHA1 mechanism.
*/
typedef struct sha1_ctx {
} sha1_ctx_t;
/*
* Context for SHA1-HMAC and SHA1-HMAC-GENERAL mechanisms.
*/
typedef struct sha1_hmac_ctx {
/*
* Macros to access the SHA1 or SHA1-HMAC contexts from a context passed
* by KCF to one of the entry points.
*/
/* to extract the digest length passed as mechanism parameter */
#define PROV_SHA1_GET_DIGEST_LEN(m, len) { \
else { \
} \
}
}
/*
* Mechanism info structure passed to KCF during registration.
*/
static crypto_mech_info_t sha1_mech_info_tab[] = {
/* SHA1 */
0, 0, CRYPTO_KEYSIZE_UNIT_IN_BITS},
/* SHA1-HMAC */
/* SHA1-HMAC GENERAL */
};
static crypto_control_ops_t sha1_control_ops = {
};
static crypto_digest_ops_t sha1_digest_ops = {
NULL,
};
static crypto_mac_ops_t sha1_mac_ops = {
NULL,
};
static int sha1_create_ctx_template(crypto_provider_handle_t,
static int sha1_free_context(crypto_ctx_t *);
static crypto_ctx_ops_t sha1_ctx_ops = {
};
static crypto_ops_t sha1_crypto_ops = {
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
NULL,
};
static crypto_provider_info_t sha1_prov_info = {
"SHA1 Software Provider",
{&modlinkage},
NULL,
sizeof (sha1_mech_info_tab)/sizeof (crypto_mech_info_t),
};
int
_init()
{
int ret;
return (ret);
/*
* Register with KCF. If the registration fails, log an
* error but do not uninstall the module, since the functionality
*/
&sha1_prov_handle)) != CRYPTO_SUCCESS)
"crypto_register_provider() failed (0x%x)", ret);
return (0);
}
int
{
}
#endif /* _KERNEL */
/*
* SHA1Init()
*
* purpose: initializes the sha1 context and begins and sha1 digest operation
* input: SHA1_CTX * : the context to initializes.
* output: void
*/
void
{
/*
* load magic initialization constants. Tell lint
* that these constants are unsigned by using U.
*/
}
#ifdef VIS_SHA1
static int usevis = 0;
#ifdef _KERNEL
/* the alignment for block stores to save fp registers */
#define VIS_ALIGN (64)
extern int sha1_savefp(kfpu_t *, int);
extern void sha1_restorefp(kfpu_t *);
#else /* !_KERNEL */
static int
havevis()
{
char *isa_token;
char *lasts;
int ret = 0;
if (checked_vis) {
return (usevis);
}
return (0);
}
return (0);
/* We lost some because our buffer was too small */
return (0);
}
return (0);
}
}
/*
* Check the relative posistions of sparcv9 & sparcv9+vis
* because they are listed in (best) performance order.
* For example: The Niagara chip reports it has VIS but the
* SHA1 code runs faster without this optimisation.
*/
isa_token_num = 0;
do {
}
usevis = 1;
return (usevis);
}
#endif /* _KERNEL */
/*
* VIS SHA-1 consts.
*/
0x8000000080000000ULL,
0x0002000200020002ULL,
0x5a8279996ed9eba1ULL,
0x8f1bbcdcca62c1d6ULL,
0x012389ab456789abULL};
/*
* SHA1Update()
*
* purpose: continues an sha1 digest operation, using the message block
* to update the context.
* input: SHA1_CTX * : the context to update
* uint8_t * : the message block
* uint32_t : the length of the message block in bytes
* output: void
*/
void
{
/* check for noop */
if (input_len == 0)
return;
/* compute number of bytes mod 64 */
/* update number of bits */
/* transform as many times as possible */
i = 0;
#ifdef _KERNEL
int svfp_ok;
#else
if (!checked_vis)
#endif /* _KERNEL */
/*
* general optimization:
*
* only do initial bcopy() and SHA1Transform() if
* buf_index != 0. if buf_index == 0, we're just
* wasting our time doing the bcopy() since there
* wasn't any data left over from a previous call to
* SHA1Update().
*/
if (buf_index) {
if (usevis) {
} else {
}
i = buf_len;
}
/*
* VIS SHA-1: uses the VIS 1.0 instructions to accelerate
* SHA-1 processing. This is achieved by "offloading" the
* computation of the message schedule (MS) to the VIS units.
* This allows the VIS computation of the message schedule
* to be performed in parallel with the standard integer
* processing of the remainder of the SHA-1 computation.
* performance by up to around 1.37X, compared to an optimized
* integer-only implementation.
*
* The VIS implementation of SHA1Transform has a different API
* to the standard integer version:
*
* void SHA1TransformVIS(
* uint64_t *, // Pointer to MS for ith block
* uint64_t *, // Pointer to ith block of message data
* uint32_t *, // Pointer to SHA state i.e ctx->state
* uint64_t *, // Pointer to various VIS constants
* )
*
* Note: the message data must by 4-byte aligned.
*
* Function requires VIS 1.0 support.
*
* Handling is provided to deal with arbitrary byte alingment
* of the input data but the performance gains are reduced
* for alignments other than 4-bytes.
*/
if (usevis) {
/*
* Main processing loop - input misaligned
*/
}
} else {
/*
* Main processing loop - input 8-byte aligned
*/
}
}
#ifdef _KERNEL
#endif /* _KERNEL */
} else {
}
}
/*
* general optimization:
*
* if i and input_len are the same, return now instead
* of calling bcopy(), since the bcopy() in this case
* will be an expensive nop.
*/
if (input_len == i)
return;
buf_index = 0;
}
/* buffer remaining input */
}
#else /* VIS_SHA1 */
void
{
/* check for noop */
if (input_len == 0)
return;
/* compute number of bytes mod 64 */
/* update number of bits */
/* transform as many times as possible */
i = 0;
/*
* general optimization:
*
* only do initial bcopy() and SHA1Transform() if
* buf_index != 0. if buf_index == 0, we're just
* wasting our time doing the bcopy() since there
* wasn't any data left over from a previous call to
* SHA1Update().
*/
if (buf_index) {
i = buf_len;
}
/*
* general optimization:
*
* if i and input_len are the same, return now instead
* of calling bcopy(), since the bcopy() in this case
* will be an expensive nop.
*/
if (input_len == i)
return;
buf_index = 0;
}
/* buffer remaining input */
}
#endif /* VIS_SHA1 */
/*
* SHA1Final()
*
* purpose: ends an sha1 digest operation, finalizing the message digest and
* zeroing the context.
* input: uint8_t * : a buffer to store the digest in
* SHA1_CTX * : the context to finalize, save, and zero
* output: void
*/
void
{
/* store bit count, big endian */
/* pad out to 56 mod 64 */
/* append length (before padding) */
/* store state in digest */
}
/*
* sparc optimization:
*
* on the sparc, we can load big endian 32-bit data easily. note that
* special care must be taken to ensure the address is 32-bit aligned.
* in the interest of speed, we don't check to make sure, since
* careful programming can guarantee this for us.
*/
#if defined(_BIG_ENDIAN)
#else /* little endian -- will work on big endian, but slowly */
#define LOAD_BIG_32(addr) \
#endif
/*
* sparc register window optimization:
*
* `a', `b', `c', `d', and `e' are passed into SHA1Transform
* explicitly since it increases the number of registers available to
* the compiler. under this scheme, these variables can be held in
* %i0 - %i4, which leaves more local and out registers available.
*/
/*
* SHA1Transform()
*
* purpose: sha1 transformation -- updates the digest based on `block'
* input: uint32_t : bytes 1 - 4 of the digest
* uint32_t : bytes 5 - 8 of the digest
* uint32_t : bytes 9 - 12 of the digest
* uint32_t : bytes 12 - 16 of the digest
* uint32_t : bytes 16 - 20 of the digest
* SHA1_CTX * : the context to update
* uint8_t [64]: the block to use to update the digest
* output: void
*/
void
{
/*
* sparc optimization:
*
* while it is somewhat counter-intuitive, on sparc, it is
* more efficient to place all the constants used in this
* function in an array and load the values out of the array
* than to manually load the constants. this is because
* setting a register to a 32-bit value takes two ops in most
* cases: a `sethi' and an `or', but loading a 32-bit value
* from memory only takes one `ld' (or `lduw' on v9). while
* this increases memory usage, the compiler can find enough
* other things to do while waiting to keep the pipeline does
* not stall. additionally, it is likely that many of these
* constants are cached so that later accesses do not even go
* out to the bus.
*
* this array is declared `static' to keep the compiler from
* having to bcopy() this array onto the stack frame of
* SHA1Transform() each time it is called -- which is
* unacceptably expensive.
*
* the `const' is to ensure that callers are good citizens and
* do not try to munge the array. since these routines are
* going to be called from inside multithreaded kernelland,
* this is a good safety check. -- `sha1_consts' will end up in
* .rodata.
*
* unfortunately, loading from an array in this manner hurts
* performance under intel. so, there is a macro,
* SHA1_CONST(), used in SHA1Transform(), that either expands to
* a reference to this array, or to the actual constant,
* depending on what platform this code is compiled for.
*/
#if defined(__sparc)
static const uint32_t sha1_consts[] = {
};
#endif
/*
* general optimization:
*
* use individual integers instead of using an array. this is a
* win, although the amount it wins by seems to vary quite a bit.
*/
/*
* sparc optimization:
*
* if `block' is already aligned on a 4-byte boundary, use
* LOAD_BIG_32() directly. otherwise, bcopy() into a
* buffer that *is* aligned on a 4-byte boundary and then do
* the LOAD_BIG_32() on that buffer. benchmarks have shown
* that using the bcopy() is better than loading the bytes
* individually and doing the endian-swap by hand.
*
* even though it's quite tempting to assign to do:
*
* blk = bcopy(ctx->buf_un.buf32, blk, sizeof (ctx->buf_un.buf32));
*
* and only have one set of LOAD_BIG_32()'s, the compiler
* *does not* like that, so please resist the urge.
*/
#if defined(__sparc)
} else {
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
/*LINTED*/
}
#else
#endif
/*
* general optimization:
*
* even though this approach is described in the standard as
* being slower algorithmically, it is 30-40% faster than the
* "faster" version under SPARC, because this version has more
* of the constraints specified at compile-time and uses fewer
* variables (and therefore has better register utilization)
* than its "speedier" brother. (i've tried both, trust me)
*
* for either method given in the spec, there is an "assignment"
* phase where the following takes place:
*
* tmp = (main_computation);
* e = d; d = c; c = rotate_left(b, 30); b = a; a = tmp;
*
* we can make the algorithm go faster by not doing this work,
* but just pretending that `d' is now `e', etc. this works
* really well and obviates the need for a temporary variable.
* however, we still explictly perform the rotate action,
* since it is cheaper on SPARC to do it once than to have to
* do it over and over again.
*/
/* round 1 */
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
/* round 2 */
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
/* round 3 */
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
/* round 4 */
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
c = ROTATE_LEFT(c, 30);
b = ROTATE_LEFT(b, 30);
a = ROTATE_LEFT(a, 30);
e = ROTATE_LEFT(e, 30);
d = ROTATE_LEFT(d, 30);
SHA1_CONST(3);
/* zeroize sensitive information */
}
/*
* devpro compiler optimization:
*
* the compiler can generate better code if it knows that `input' and
* `output' do not point to the same source. there is no portable
* way to tell the compiler this, but the sun compiler recognizes the
* `_Restrict' keyword to indicate this condition. use it if possible.
*/
#ifdef __RESTRICT
#define restrict _Restrict
#else
#define restrict /* nothing */
#endif
/*
* Encode()
*
* purpose: to convert a list of numbers from little endian to big endian
* input: uint8_t * : place to store the converted big endian numbers
* uint32_t * : place to get numbers to convert from
* size_t : the length of the input in bytes
* output: void
*/
static void
{
size_t i, j;
#if defined(__sparc)
for (i = 0, j = 0; j < len; i++, j += 4) {
/* LINTED: pointer alignment */
}
} else {
#endif /* little endian -- will work on big endian, but slowly */
for (i = 0, j = 0; j < len; i++, j += 4) {
}
#if defined(__sparc)
}
#endif
}
#ifdef _KERNEL
/*
* KCF software provider control entry points.
*/
/* ARGSUSED */
static void
{
}
/*
* KCF software provider digest entry points.
*/
static int
{
return (CRYPTO_MECHANISM_INVALID);
/*
* Allocate and initialize SHA1 context.
*/
crypto_kmflag(req));
return (CRYPTO_HOST_MEMORY);
return (CRYPTO_SUCCESS);
}
/*
* Helper SHA1 digest update function for uio data.
*/
static int
{
/* we support only kernel buffer */
return (CRYPTO_ARGUMENTS_BAD);
/*
* Jump to the first iovec containing data to be
* digested.
*/
/*
* The caller specified an offset that is larger than the
* total size of the buffers it provided.
*/
return (CRYPTO_DATA_LEN_RANGE);
}
/*
* Now do the digesting on the iovecs.
*/
cur_len);
vec_idx++;
offset = 0;
}
/*
* The end of the specified iovec's was reached but
* the length requested could not be processed, i.e.
* The caller requested to digest more data than it provided.
*/
return (CRYPTO_DATA_LEN_RANGE);
}
return (CRYPTO_SUCCESS);
}
/*
* Helper SHA1 digest final function for uio data.
* digest_len is the length of the desired digest. If digest_len
* is smaller than the default SHA1 digest length, the caller
* must pass a scratch buffer, digest_scratch, which must
* be at least SHA1_DIGEST_LENGTH bytes.
*/
static int
{
/* we support only kernel buffer */
return (CRYPTO_ARGUMENTS_BAD);
/*
* Jump to the first iovec containing ptr to the digest to
* be returned.
*/
/*
* The caller specified an offset that is
* larger than the total size of the buffers
* it provided.
*/
return (CRYPTO_DATA_LEN_RANGE);
}
if (offset + digest_len <=
/*
* The computed SHA1 digest will fit in the current
* iovec.
*/
if (digest_len != SHA1_DIGEST_LENGTH) {
/*
* The caller requested a short digest. Digest
* into a scratch buffer and return to
* the user only what was requested.
*/
} else {
sha1_ctx);
}
} else {
/*
* The computed digest will be crossing one or more iovec's.
* This is bad performance-wise but we need to support it.
* Allocate a small scratch buffer on the stack and
* copy it piece meal to the specified digest iovec's.
*/
off_t scratch_offset = 0;
cur_len);
vec_idx++;
offset = 0;
}
/*
* The end of the specified iovec's was reached but
* the length requested could not be processed, i.e.
* The caller requested to digest more data than it
* provided.
*/
return (CRYPTO_DATA_LEN_RANGE);
}
}
return (CRYPTO_SUCCESS);
}
/*
* Helper SHA1 digest update for mblk's.
*/
static int
{
/*
* Jump to the first mblk_t containing data to be digested.
*/
/*
* The caller specified an offset that is larger than the
* total size of the buffers it provided.
*/
return (CRYPTO_DATA_LEN_RANGE);
}
/*
* Now do the digesting on the mblk chain.
*/
offset = 0;
}
/*
* The end of the mblk was reached but the length requested
* could not be processed, i.e. The caller requested
* to digest more data than it provided.
*/
return (CRYPTO_DATA_LEN_RANGE);
}
return (CRYPTO_SUCCESS);
}
/*
* Helper SHA1 digest final for mblk's.
* digest_len is the length of the desired digest. If digest_len
* is smaller than the default SHA1 digest length, the caller
* must pass a scratch buffer, digest_scratch, which must
* be at least SHA1_DIGEST_LENGTH bytes.
*/
static int
{
/*
* Jump to the first mblk_t that will be used to store the digest.
*/
/*
* The caller specified an offset that is larger than the
* total size of the buffers it provided.
*/
return (CRYPTO_DATA_LEN_RANGE);
}
/*
* The computed SHA1 digest will fit in the current mblk.
* Do the SHA1Final() in-place.
*/
if (digest_len != SHA1_DIGEST_LENGTH) {
/*
* The caller requested a short digest. Digest
* into a scratch buffer and return to
* the user only what was requested.
*/
} else {
}
} else {
/*
* The computed digest will be crossing one or more mblk's.
* This is bad performance-wise but we need to support it.
* Allocate a small scratch buffer on the stack and
* copy it piece meal to the specified digest iovec's.
*/
off_t scratch_offset = 0;
offset = 0;
}
/*
* The end of the specified mblk was reached but
* the length requested could not be processed, i.e.
* The caller requested to digest more data than it
* provided.
*/
return (CRYPTO_DATA_LEN_RANGE);
}
}
return (CRYPTO_SUCCESS);
}
/* ARGSUSED */
static int
{
int ret = CRYPTO_SUCCESS;
/*
* We need to just return the length needed to store the output.
* We should not destroy the context for the following cases.
*/
return (CRYPTO_BUFFER_TOO_SMALL);
}
/*
* Do the SHA1 update on the specified input data.
*/
case CRYPTO_DATA_RAW:
break;
case CRYPTO_DATA_UIO:
data);
break;
case CRYPTO_DATA_MBLK:
data);
break;
default:
}
if (ret != CRYPTO_SUCCESS) {
/* the update failed, free context and bail */
return (ret);
}
/*
* Do a SHA1 final, must be done separately since the digest
* type can be different than the input data type.
*/
case CRYPTO_DATA_RAW:
break;
case CRYPTO_DATA_UIO:
break;
case CRYPTO_DATA_MBLK:
break;
default:
}
/* all done, free context and return */
if (ret == CRYPTO_SUCCESS) {
} else {
}
return (ret);
}
/* ARGSUSED */
static int
{
int ret = CRYPTO_SUCCESS;
/*
* Do the SHA1 update on the specified input data.
*/
case CRYPTO_DATA_RAW:
break;
case CRYPTO_DATA_UIO:
data);
break;
case CRYPTO_DATA_MBLK:
data);
break;
default:
}
return (ret);
}
/* ARGSUSED */
static int
{
int ret = CRYPTO_SUCCESS;
/*
* We need to just return the length needed to store the output.
* We should not destroy the context for the following cases.
*/
return (CRYPTO_BUFFER_TOO_SMALL);
}
/*
* Do a SHA1 final.
*/
case CRYPTO_DATA_RAW:
break;
case CRYPTO_DATA_UIO:
break;
case CRYPTO_DATA_MBLK:
break;
default:
}
/* all done, free context and return */
if (ret == CRYPTO_SUCCESS) {
} else {
}
return (ret);
}
/* ARGSUSED */
static int
{
int ret = CRYPTO_SUCCESS;
return (CRYPTO_MECHANISM_INVALID);
/*
* Do the SHA1 init.
*/
/*
* Do the SHA1 update on the specified input data.
*/
case CRYPTO_DATA_RAW:
break;
case CRYPTO_DATA_UIO:
break;
case CRYPTO_DATA_MBLK:
break;
default:
}
if (ret != CRYPTO_SUCCESS) {
/* the update failed, bail */
return (ret);
}
/*
* Do a SHA1 final, must be done separately since the digest
* type can be different than the input data type.
*/
case CRYPTO_DATA_RAW:
break;
case CRYPTO_DATA_UIO:
break;
case CRYPTO_DATA_MBLK:
break;
default:
}
if (ret == CRYPTO_SUCCESS) {
} else {
}
return (ret);
}
/*
* KCF software provider mac entry points.
*
* SHA1 HMAC is: SHA1(key XOR opad, SHA1(key XOR ipad, text))
*
* Init:
* The initialization routine initializes what we denote
* as the inner and outer contexts by doing
* - for inner context: SHA1(key XOR ipad)
* - for outer context: SHA1(key XOR opad)
*
* Update:
* Each subsequent SHA1 HMAC update will result in an
* update of the inner context with the specified data.
*
* Final:
* The SHA1 HMAC final will do a SHA1 final operation on the
* inner context, and the resulting digest will be used
* as the data for an update on the outer context. Last
* but not least, a SHA1 final on the outer context will
* be performed to obtain the SHA1 HMAC digest to return
* to the user.
*/
/*
* Initialize a SHA1-HMAC context.
*/
static void
{
uint_t i;
/* XOR key with ipad (0x36) and opad (0x5c) */
for (i = 0; i < SHA1_HMAC_INTS_PER_BLOCK; i++) {
ipad[i] ^= 0x36363636;
opad[i] ^= 0x5c5c5c5c;
}
/* perform SHA1 on ipad */
/* perform SHA1 on opad */
}
/*
*/
static int
{
int ret = CRYPTO_SUCCESS;
return (CRYPTO_MECHANISM_INVALID);
/* Add support for key by attributes (RFE 4706552) */
return (CRYPTO_ARGUMENTS_BAD);
crypto_kmflag(req));
return (CRYPTO_HOST_MEMORY);
if (ctx_template != NULL) {
/* reuse context template */
sizeof (sha1_hmac_ctx_t));
} else {
/* no context template, compute context */
if (keylen_in_bytes > SHA1_HMAC_BLOCK_SIZE) {
/*
* Hash the passed-in key to get a smaller key.
* The inner context is used since it hasn't been
* initialized yet.
*/
} else {
}
}
/*
* Get the mechanism parameters, if applicable.
*/
}
if (ret != CRYPTO_SUCCESS) {
}
return (ret);
}
/* ARGSUSED */
static int
{
int ret = CRYPTO_SUCCESS;
/*
* Do a SHA1 update of the inner context using the specified
* data.
*/
case CRYPTO_DATA_RAW:
break;
case CRYPTO_DATA_UIO:
break;
case CRYPTO_DATA_MBLK:
break;
default:
}
return (ret);
}
/* ARGSUSED */
static int
{
int ret = CRYPTO_SUCCESS;
/*
* We need to just return the length needed to store the output.
* We should not destroy the context for the following cases.
*/
return (CRYPTO_BUFFER_TOO_SMALL);
}
/*
* Do a SHA1 final on the inner context.
*/
/*
* Do a SHA1 update on the outer context, feeding the inner
* digest as data.
*/
/*
* Do a SHA1 final on the outer context, storing the computing
* digest in the users buffer.
*/
case CRYPTO_DATA_RAW:
if (digest_len != SHA1_DIGEST_LENGTH) {
/*
* The caller requested a short digest. Digest
* into a scratch buffer and return to
* the user only what was requested.
*/
} else {
}
break;
case CRYPTO_DATA_UIO:
digest_len, digest);
break;
case CRYPTO_DATA_MBLK:
digest_len, digest);
break;
default:
}
if (ret == CRYPTO_SUCCESS) {
} else {
}
return (ret);
}
case CRYPTO_DATA_RAW: \
break; \
case CRYPTO_DATA_UIO: \
break; \
case CRYPTO_DATA_MBLK: \
data); \
break; \
default: \
ret = CRYPTO_ARGUMENTS_BAD; \
} \
}
/* ARGSUSED */
static int
{
int ret = CRYPTO_SUCCESS;
return (CRYPTO_MECHANISM_INVALID);
/* Add support for key by attributes (RFE 4706552) */
return (CRYPTO_ARGUMENTS_BAD);
if (ctx_template != NULL) {
/* reuse context template */
} else {
/* no context template, initialize context */
if (keylen_in_bytes > SHA1_HMAC_BLOCK_SIZE) {
/*
* Hash the passed-in key to get a smaller key.
* The inner context is used since it hasn't been
* initialized yet.
*/
} else {
}
}
/* get the mechanism parameters, if applicable */
goto bail;
}
if (digest_len > SHA1_DIGEST_LENGTH) {
goto bail;
}
}
/* do a SHA1 update of the inner context using the specified data */
if (ret != CRYPTO_SUCCESS)
/* the update failed, free context and bail */
goto bail;
/*
* Do a SHA1 final on the inner context.
*/
/*
* Do an SHA1 update on the outer context, feeding the inner
* digest as data.
*/
/*
* Do a SHA1 final on the outer context, storing the computed
* digest in the users buffer.
*/
case CRYPTO_DATA_RAW:
if (digest_len != SHA1_DIGEST_LENGTH) {
/*
* The caller requested a short digest. Digest
* into a scratch buffer and return to
* the user only what was requested.
*/
} else {
}
break;
case CRYPTO_DATA_UIO:
digest_len, digest);
break;
case CRYPTO_DATA_MBLK:
digest_len, digest);
break;
default:
}
if (ret == CRYPTO_SUCCESS) {
} else {
}
/* Extra paranoia: zeroize the context on the stack */
return (ret);
bail:
return (ret);
}
/* ARGSUSED */
static int
{
int ret = CRYPTO_SUCCESS;
return (CRYPTO_MECHANISM_INVALID);
/* Add support for key by attributes (RFE 4706552) */
return (CRYPTO_ARGUMENTS_BAD);
if (ctx_template != NULL) {
/* reuse context template */
} else {
/* no context template, initialize context */
if (keylen_in_bytes > SHA1_HMAC_BLOCK_SIZE) {
/*
* Hash the passed-in key to get a smaller key.
* The inner context is used since it hasn't been
* initialized yet.
*/
} else {
}
}
/* get the mechanism parameters, if applicable */
goto bail;
}
if (digest_len > SHA1_DIGEST_LENGTH) {
goto bail;
}
}
goto bail;
}
/* do a SHA1 update of the inner context using the specified data */
if (ret != CRYPTO_SUCCESS)
/* the update failed, free context and bail */
goto bail;
/* do a SHA1 final on the inner context */
/*
* Do an SHA1 update on the outer context, feeding the inner
* digest as data.
*/
/*
* Do a SHA1 final on the outer context, storing the computed
* digest in the users buffer.
*/
/*
* Compare the computed digest against the expected digest passed
* as argument.
*/
case CRYPTO_DATA_RAW:
break;
case CRYPTO_DATA_UIO: {
off_t scratch_offset = 0;
/* we support only kernel buffer */
return (CRYPTO_ARGUMENTS_BAD);
/* jump to the first iovec containing the expected digest */
for (vec_idx = 0;
/*
* The caller specified an offset that is
* larger than the total size of the buffers
* it provided.
*/
break;
}
/* do the comparison of computed digest vs specified one */
cur_len) != 0) {
break;
}
vec_idx++;
offset = 0;
}
break;
}
case CRYPTO_DATA_MBLK: {
off_t scratch_offset = 0;
/* jump to the first mblk_t containing the expected digest */
/*
* The caller specified an offset that is larger than
* the total size of the buffers it provided.
*/
break;
}
break;
}
offset = 0;
}
break;
}
default:
}
return (ret);
bail:
return (ret);
}
/*
* KCF software provider context management entry points.
*/
/* ARGSUSED */
static int
{
return (CRYPTO_MECHANISM_INVALID);
}
/* Add support for key by attributes (RFE 4706552) */
return (CRYPTO_ARGUMENTS_BAD);
/*
* Allocate and initialize SHA1 context.
*/
crypto_kmflag(req));
if (sha1_hmac_ctx_tmpl == NULL)
return (CRYPTO_HOST_MEMORY);
if (keylen_in_bytes > SHA1_HMAC_BLOCK_SIZE) {
/*
* Hash the passed-in key to get a smaller key.
* The inner context is used since it hasn't been
* initialized yet.
*/
} else {
}
*ctx_template_size = sizeof (sha1_hmac_ctx_t);
return (CRYPTO_SUCCESS);
}
static int
{
return (CRYPTO_SUCCESS);
/*
* We have to free either SHA1 or SHA1-HMAC contexts, which
* have different lengths.
*/
if (mech_type == SHA1_MECH_INFO_TYPE)
ctx_len = sizeof (sha1_ctx_t);
else {
ctx_len = sizeof (sha1_hmac_ctx_t);
}
return (CRYPTO_SUCCESS);
}
#endif /* _KERNEL */