2014-11-24 10:06:20 +00:00
|
|
|
/* ====================================================================
|
|
|
|
* Copyright (c) 1998-2014 The OpenSSL Project. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
*
|
|
|
|
* 3. All advertising materials mentioning features or use of this
|
|
|
|
* software must display the following acknowledgment:
|
|
|
|
* "This product includes software developed by the OpenSSL Project
|
|
|
|
* for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
|
|
|
|
*
|
|
|
|
* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
|
|
|
|
* endorse or promote products derived from this software without
|
|
|
|
* prior written permission. For written permission, please contact
|
|
|
|
* openssl-core@openssl.org.
|
|
|
|
*
|
|
|
|
* 5. Products derived from this software may not be called "OpenSSL"
|
|
|
|
* nor may "OpenSSL" appear in their names without prior written
|
|
|
|
* permission of the OpenSSL Project.
|
|
|
|
*
|
|
|
|
* 6. Redistributions of any form whatsoever must retain the following
|
|
|
|
* acknowledgment:
|
|
|
|
* "This product includes software developed by the OpenSSL Project
|
|
|
|
* for use in the OpenSSL Toolkit (http://www.openssl.org/)"
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
|
|
|
|
* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
|
|
|
|
* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
|
|
|
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
|
|
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
|
|
|
|
* OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
* ====================================================================
|
|
|
|
*
|
|
|
|
* This product includes cryptographic software written by Eric Young
|
|
|
|
* (eay@cryptsoft.com). This product includes software written by Tim
|
|
|
|
* Hudson (tjh@cryptsoft.com).
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef HEADER_BN_INT_H
|
|
|
|
#define HEADER_BN_INT_H
|
|
|
|
|
|
|
|
|
|
|
|
#include <openssl/bn.h>
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
2014-11-02 20:16:59 +00:00
|
|
|
#define bn_expand(a,bits) ((((((bits+BN_BITS2-1))/BN_BITS2)) <= (a)->dmax)?\
|
|
|
|
(a):bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2))
|
|
|
|
BIGNUM *bn_wexpand(BIGNUM *a, int words);
|
|
|
|
BIGNUM *bn_expand2(BIGNUM *a, int words);
|
|
|
|
|
|
|
|
void bn_correct_top(BIGNUM *a);
|
|
|
|
|
2014-11-24 10:06:20 +00:00
|
|
|
/* Determine the modified width-(w+1) Non-Adjacent Form (wNAF) of 'scalar'.
|
|
|
|
* This is an array r[] of values that are either zero or odd with an
|
|
|
|
* absolute value less than 2^w satisfying
|
|
|
|
* scalar = \sum_j r[j]*2^j
|
|
|
|
* where at most one of any w+1 consecutive digits is non-zero
|
|
|
|
* with the exception that the most significant digit may be only
|
|
|
|
* w-1 zeros away from that next non-zero digit.
|
|
|
|
*/
|
|
|
|
signed char *bn_compute_wNAF(const BIGNUM *scalar, int w, size_t *ret_len);
|
|
|
|
|
|
|
|
int bn_get_top(const BIGNUM *a);
|
|
|
|
|
|
|
|
void bn_set_top(BIGNUM *a, int top);
|
|
|
|
|
|
|
|
int bn_get_dmax(const BIGNUM *a);
|
|
|
|
|
|
|
|
/* Set all words to zero */
|
|
|
|
void bn_set_all_zero(BIGNUM *a);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy the internal BIGNUM words into out which holds size elements (and size
|
|
|
|
* must be bigger than top)
|
|
|
|
*/
|
|
|
|
int bn_copy_words(BN_ULONG *out, const BIGNUM *in, int size);
|
|
|
|
|
|
|
|
BN_ULONG *bn_get_words(const BIGNUM *a);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set the internal data words in a to point to words which contains size
|
|
|
|
* elements. The BN_FLG_STATIC_DATA flag is set
|
|
|
|
*/
|
|
|
|
void bn_set_static_words(BIGNUM *a, BN_ULONG *words, int size);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy data into the BIGNUM. The caller must check that dmax is sufficient to
|
|
|
|
* hold the data
|
|
|
|
*/
|
|
|
|
void bn_set_data(BIGNUM *a, const void *data, size_t size);
|
|
|
|
|
|
|
|
size_t bn_sizeof_BIGNUM(void);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return element el from an array of BIGNUMs starting at base (required
|
|
|
|
* because callers do not know the size of BIGNUM at compilation time)
|
|
|
|
*/
|
|
|
|
BIGNUM *bn_array_el(BIGNUM *base, int el);
|
|
|
|
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|